mlsanityData to 14 Oct 2026

Simulation-Free Differential Dynamics through Neural Conservation Laws

arXiv 2506.18604 ↗First posted 23 Jun 2025cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

We present a novel simulation-free framework for training continuous-time diffusion processes over very general objective functions. Existing methods typically involve either prescribing the optimal diffusion process -- which only works for heavily restricted problem formulations -- or require expensive simulation to numerically obtain the time-dependent densities and sample from the diffusion process. In contrast, we propose a coupled parameterization which jointly models a time-dependent density function, or probability path, and the dynamics of a diffusion process that generates this probability path. To accomplish this, our approach directly bakes in the Fokker-Planck equation and density function requirements as hard constraints, by extending and greatly simplifying the construction of Neural Conservation Laws. This enables simulation-free training for a large variety of problem formulations, from data-driven objectives as in generative modeling and dynamical optimal transport, to optimality-based objectives as in stochastic optimal control, with straightforward extensions to mean-field objectives due to the ease of accessing exact density functions. We validate our method in a diverse range of application domains from modeling spatio-temporal events to learning optimal dynamics from population data.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 26 of its 48 references that are in the map. First posted on arXiv 23 Jun 2025.

Builds on

26 of 48 references.

References · 26

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  4. 2018Neural Ordinary Differential Equationscited by 3,779
  5. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
  6. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
  7. 2022Building Normalizing Flows with Stochastic Interpolantscited by 995
  8. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 939
  9. 2024SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformerscited by 737
  10. 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 640
  11. 2022Scientific Machine Learning through Physics-Informed Neural Networks: Where we are and What's nextcited by 608
  12. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
14 more
  1. 2017PixelCNN++: Improving the PixelCNN with Discretized Logistic Mixture Likelihood and Other Modificationscited by 417
  2. 2015MADE: Masked Autoencoder for Distribution Estimationcited by 307
  3. 2020Scalable Gradients for Stochastic Differential Equationscited by 271
  4. 2019Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Designcited by 262
  5. 2019Residual Flows for Invertible Generative Modelingcited by 257
  6. 2021Path Integral Sampler: a stochastic control approach for samplingcited by 181
  7. 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
  8. 2021Neural Flows: Efficient Alternative to Neural ODEscited by 101
  9. 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 98
  10. 2020Neural Spatio-Temporal Point Processescited by 93
  11. 2022Neural Conservation Laws: A Divergence-Free Perspectivecited by 70
  12. 2023Generalized Schr"odinger Bridge Matchingcited by 40
  13. 2022Stochastic Optimal Control for Collective Variable Free Sampling of Molecular Transition Pathscited by 38
  14. 2023Accelerating Motion Planning via Optimal Transportcited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.