Skip to content

Wasserstein Residuals: Learning Gradient Flows from Population Dynamics

Jul 2026 · arXiv.org · Vol abs/2607.04738 · 0 citations · 57 references
Computer Science Mathematics

TL;DR

It is demonstrated that the stitching method achieves state-of-the-art performance across trajectory inference benchmarks, and unifies several existing methods and leads to a new particle-based method, stitching, that is simulation-free and robust to large gaps between observations.

Abstract

Reconstructing population dynamics is a central problem in the physical and data sciences. Often, the dynamics are modeled as a Wasserstein gradient flow (WGF): a curve of distributions driven by an energy functional. Though there are multiple mathematical characterizations of a WGF, the dominant algorithmic approach relies on the Jordan--Kinderlehrer--Otto (JKO) scheme. JKO-based methods are inflexible to time discretisation and require solving costly optimal transport problems. We take a residual approach, enforcing the continuity equations via a non-negative loss function whose minimum is the WGF. Combined with a data-fitting divergence, this gives a single global objective. This perspective unifies several existing methods and leads to a new particle-based method, stitching, that is simulation-free and robust to large gaps between observations. We demonstrate that the stitching method achieves state-of-the-art performance across trajectory inference benchmarks. For code see github.com/BasisResearch/wasserstein-residuals.

View source

Similar papers

Jul 2026

Learning Population-Level Dynamics through a Latent Fokker-Planck Model and Discrepancy Transport Maps

This work presents a population-level inference framework that recovers latent stochastic dynamics directly from snapshot probability distributions by decomposing the observed evolution into an intrinsic latent stochastic process and a discrepancy transport map that captures geometric deformation between the latent and...

Cheng-Yang Huang, K. Garikipati · 0 citations
Aug 2026

Optimal Initialization Scale for Neural Networks With Locally Quadratic Loss Landscapes: An SGD Dynamics Perspective.

Stochastic gradient descent (SGD), one of the most fundamental optimization algorithms in machine learning (ML), can be recast through a continuous-time approximation as a Fokker-Planck equation for Langevin dynamics, a viewpoint that has motivated many theoretical studies. Within this framework, we study the relations...

H. Horii, S. Has · 0 citations
Preprint Aug 2026

StocBench: A Benchmark for Generative Modeling of Stochastic Dynamics

While stochastic diffusion samplers such as DDPM better preserve the enstrophy spectrum during rollouts in the stochastic setting, deterministic samplers such as DDIM and DPM-2 show better spectral preservation in the deterministic setting.

S. Pfister, Benjamin J. Holzschuh, Nils Thürey · 2 citations
Preprint Aug 2026

Self-supervised In-context Operator Learning for Stochastic Mean-Field Control

Stochastic mean-field control (MFC) provides a fundamental framework for coordinating large populations of interacting agents under uncertainty, with a wide range of applications. Existing numerical and deep-learning methods solve one MFC problem instance at a time and must be re-optimized whenever the task changes. In...

Suyi Gao, Mo Zhou, Rong-Jie Lai · 0 citations
Preprint Aug 2026

Beckmann Transport Models: From Autonomous Flows to One-Step Maps

We propose an instantiation of flow matching that relies on a time-independent velocity field (an \emph{autonomous flow}) to exactly map between two distributions, so long as the target is singular, i.e.\ supported on a lower-dimensional data manifold. We also show that the one-step generative map associated with this...

Cheuk-Kit Lee, Florentin Coeurdoux, Yuyuan Chen et al. · 4 citations
#machine learning Preprint Aug 2026

Propensity Straight-Through Gradients for Discrete Stochastic Systems

This work exploits the affine state update to obtain the exact one-step conditional-mean sensitivity by differentiating normalized reaction propensities, and defines the propensity straight-through (PST) estimator, a temperature- and Gumbel-free path to scalable gradient-based learning through exact stochastic trajecto...

Jose M. G. Vilar, Leonor Saiz · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.