mlsanityData to 14 Oct 2026

Generative Modeling by Value-Driven Transport

arXiv 2605.22507 ↗First posted 21 May 2026cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a new framework for generative modeling based on a discrete-time stochastic control formulation of measure transport. Adapting classic results from control theory, we formulate our problem as a linear program whose dual variables correspond to the optimal value function of the control problem, which directly encodes the optimal control policy. Exploiting this LP formulation, we develop an efficient simulation-free primal-dual algorithm for computing approximately optimal value functions and the associated value-driven transport (VDT) policies which approximate the true optimal policy. We show that well-trained VDT policies enjoy numerous favorable properties in comparison with other state-of-the-art methods based on flows, diffusions, or Schr"odinger bridges: they lead to straight transport paths which can be simulated quickly and robustly, and can be enhanced in all the same ways as diffusion and flow-based models (e.g., conditional generation, classifier-free guidance, unpaired data-to-data translation are all easy to incorporate). We evaluate our methodology in a range of experiments, with results that indicate strong performance and good potential for scalability.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 33 of its 62 references that are in the map. First posted on arXiv 21 May 2026.

Builds on

33 of 62 references.

References · 33

  1. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  2. 2020Denoising Diffusion Implicit Modelscited by 9,781
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  4. 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,255
  5. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
  6. 2022Classifier-Free Diffusion Guidancecited by 5,847
  7. 2022Flow Matching for Generative Modelingcited by 5,702
  8. 2018Neural Ordinary Differential Equationscited by 3,779
  9. 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,761
  10. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,700
  11. 2022Elucidating the Design Space of Diffusion-Based Generative Modelscited by 3,045
  12. 2015Variational Inference with Normalizing Flowscited by 2,170
21 more
  1. 2022Diffusion Models: A Comprehensive Survey of Methods and Applicationscited by 1,114
  2. 2022Building Normalizing Flows with Stochastic Interpolantscited by 995
  3. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 939
  4. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
  5. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 602
  6. 2024Flow Matching Guide and Codecited by 301
  7. 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transportcited by 283
  8. 2023I2SB: Image-to-Image Schr"odinger Bridgecited by 218
  9. 2017A unified view of entropy-regularized Markov decision processescited by 182
  10. 2023Diffusion Schr"odinger Bridge Matchingcited by 153
  11. 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 98
  12. 2023Simulation-free Schr"odinger bridges via score and flow matchingcited by 83
  13. 2025The Principles of Diffusion Modelscited by 76
  14. 2024Schr"odinger Bridge Flow for Unpaired Data Translationcited by 47
  15. 2024Light and Optimal Schr"odinger Bridge Matchingcited by 45
  16. 2020Logistic Q-Learningcited by 34
  17. 2024Adversarial Schr"odinger Bridge Matchingcited by 13
  18. 2025Optimal Transport for Machine Learnerscited by 12
  19. 2024Constrained Sampling with Primal-Dual Langevin Monte Carlocited by 10
  20. 2025Optimal and Diffusion Transports in Machine Learningcited by 6
  21. 2024Offline RL via Feature-Occupancy Gradient Ascentcited by 2

Built on by

Not cited yet.