mlsanityData to 14 Oct 2026

DICE: Discrete inverse continuity equation for learning population dynamics

arXiv 2507.05107 ↗First posted 7 Jul 2025cs.LG stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

We introduce the Discrete Inverse Continuity Equation (DICE) method, a generative modeling approach that learns the evolution of a stochastic process from given sample populations at a finite number of time points. Models learned with DICE capture the typically smooth and well-behaved population dynamics, rather than the dynamics of individual sample trajectories that can exhibit complex or even chaotic behavior. The DICE loss function is developed specifically to be invariant, even in discrete time, to spatially constant but time-varying spurious constants that can emerge during training; this invariance increases training stability and robustness. Generating a trajectory of sample populations with DICE is fast because samples evolve directly in the time interval over which the stochastic process is formulated, in contrast to approaches that condition on time and then require multiple sampling steps per time step. DICE is stable to train, in situations where other methods for learning population dynamics fail, and DICE generates representative samples with orders of magnitude lower costs than methods that have to condition on time. Numerical experiments on a wide range of problems from random waves, Vlasov-Poisson instabilities and high-dimensional chaos are included to justify these assertions.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 21 of its 52 references that are in the map. First posted on arXiv 7 Jul 2025.

Builds on

21 of 52 references.

References · 21

  1. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
  2. 2022Flow Matching for Generative Modelingcited by 5,702
  3. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
  4. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,700
  5. 2022Building Normalizing Flows with Stochastic Interpolantscited by 995
  6. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 939
  7. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
  8. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 160
  9. 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
  10. 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 98
  11. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
  12. 2022Supervised Training of Conditional Monge Mapscited by 61
9 more
  1. 2023Deep Momentum Multi-Marginal Schr"odinger Bridgecited by 42
  2. 2024Sampling in Unit Time with Kernel Fisher-Rao Flowcited by 27
  3. 2024Liouville Flow Importance Samplercited by 25
  4. 2020Fast and Smooth Interpolation on Wasserstein Spacecited by 22
  5. 2024Learning diffusion at lightspeedcited by 22
  6. 2018Second order models for optimal transport and cubic splines on the Wasserstein spacecited by 20
  7. 2025Trajectory Inference with Smooth Schr"odinger Bridgescited by 11
  8. 2024Parametric model reduction of mean-field and stochastic systems via higher-order action matchingcited by 9
  9. 2019Sequential Ensemble Transform for Bayesian Inverse Problemscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 8.

8 papers.