Wasserstein Residuals: Learning Gradient Flows from Population Dynamics
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 57 references that are in the map. First posted on arXiv 6 Jul 2026.
Builds on
33 of 57 references.
References · 33
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
- 2016Input Convex Neural Networkscited by 407
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
- 2020Scalable Gradients for Stochastic Differential Equationscited by 264
- 2021Likelihood Training of Schr"odinger Bridge using Forward-Backward SDEs Theorycited by 216
- 2023A mathematical perspective on Transformerscited by 160
21 more
- 2021Neural SDEs as Infinite-Dimensional GANscited by 159
- 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 155
- 2023Diffusion Schr"odinger Bridge Matchingcited by 151
- 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
- 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 94
- 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 91
- 2021Large-Scale Wasserstein Gradient Flowscited by 76
- 2021Efficient and Accurate Gradients for Neural SDEscited by 68
- 2022Neural Conservation Laws: A Divergence-Free Perspectivecited by 67
- 2023A Computational Framework for Solving Wasserstein Lagrangian Flowscited by 43
- 2023Deep Momentum Multi-Marginal Schr"odinger Bridgecited by 40
- 2024Multi-marginal Schr"odinger Bridges with Iterative Reference Refinementcited by 26
- 2024Learning diffusion at lightspeedcited by 21
- 2025Joint Velocity-Growth Flow Matching for Single-Cell Dynamics Modelingcited by 20
- 2025Curly Flow Matching for Learning Non-gradient Field Dynamicscited by 17
- 2024Identifying Drift, Diffusion, and Causal Structure from Temporal Snapshotscited by 10
- 2025Learning of Population Dynamics: Inverse Optimization Meets JKO Schemecited by 6
- 2025Gradient-flow SDEs have unique transient population dynamicscited by 2
- 2025Simulation-Free Differential Dynamics through Neural Conservation Lawscited by 2
- 2026Learning interacting particle systems from unlabeled datacited by 2
- 2026Generative Path-Finding Method for Wasserstein Gradient Flowcited by 1
Built on by
Not cited yet.