Beyond Gradient Flow: Identifiability and Recovery from Distribution Snapshots
Not on the map. Why?
Abstract (arXiv)
Inferring dynamics from snapshots of evolving distributions is fundamentally underdetermined: the Fokker-Planck equation constrains the drift F only through its score-weighted divergence nabla· F+F·nablalogρ, leaving a ρ-solenoidal gauge invisible to any single-time constraint. Time-indexed transport formulations cannot resolve this ambiguity: every admissible marginal path admits a curl-free explanation, minimum-action reconstruction selects it, and marginal fit alone cannot distinguish dynamically inequivalent explanations. Requiring one autonomous field to explain several marginals instead makes part of the hidden circulation visible as nablalogρ changes across marginals. Separating instantaneous Fokker-Planck source constraints from the snapshot experiment, we show that the source constraints identify the field modulo the kernel of a stacked score-weighted divergence operator. For generic Gaussian shape variation, source constraints at K≥ m time points in intrinsic dimension m eliminate every polynomial gauge direction, whereas finitely many density snapshots alone admit aliasing; we give the obstruction explicitly. At a Gaussian anchor, for Sobolev smoothness s and n samples per time point, we derive a conditional lower rate (nK)-2s/(2s+m+1) for the tangent snapshot experiment, with a matching upper rate in a degreewise benchmark. Strong-form fitting is non-orthogonal to score error and cannot be repaired by spectral filtering. Instead, we estimate using smooth test functions while retaining the known diffusion term, and derive a finite-sample bound that separates sampling error from fixed-grid quadrature bias. Planted-circulation experiments confirm the predicted gauge contraction and expose a design tension between cross-slice information and covariance-aware whitening.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
21 of 47 references.
References · 21
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
- 2022Building Normalizing Flows with Stochastic Interpolantscited by 995
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
- 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 602
- 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 160
- 2018The Mechanics of n-Player Differentiable Gamescited by 118
- 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 98
- 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
- 2020Interacting particle solutions of Fokker-Planck equations through gradient-log-density estimationcited by 88
- 2022Neural Conservation Laws: A Divergence-Free Perspectivecited by 70
9 more
- 2022Manifold Interpolating Optimal-Transport Flows for Trajectory Inferencecited by 64
- 2022Probability flow solution of the Fokker-Planck equationcited by 47
- 2021Towards a mathematical theory of trajectory inferencecited by 31
- 2024Learning diffusion at lightspeedcited by 22
- 2025Curly Flow Matching for Learning Non-gradient Field Dynamicscited by 20
- 2021The Limiting Dynamics of SGD: Modified Loss, Phase Space Oscillations, and Anomalous Diffusioncited by 19
- 2025When Scores Learn Geometry: Rate Separations under the Manifold Hypothesiscited by 14
- 2024Identifying Drift, Diffusion, and Causal Structure from Temporal Snapshotscited by 13
- 2025Multi-Marginal Stochastic Flow Matching for High-Dimensional Snapshot Data at Irregular Time Pointscited by 11
Built on by
Not cited yet.