Flow-based generative models as iterative algorithms in probability space
Not on the map. Why?
Abstract (arXiv)
Generative AI (GenAI) has revolutionized data-driven modeling by enabling the synthesis of high-dimensional data across various applications, including image generation, language modeling, biomedical signal processing, and anomaly detection. Flow-based generative models provide a powerful framework for capturing complex probability distributions, offering exact likelihood estimation, efficient sampling, and deterministic transformations between distributions. These models leverage invertible mappings governed by Ordinary Differential Equations (ODEs), enabling precise density estimation and likelihood evaluation. This tutorial presents an intuitive mathematical framework for flow-based generative models, formulating them as neural network-based representations of continuous probability densities. We explore key theoretical principles, including the Wasserstein metric, gradient flows, and density evolution governed by ODEs, to establish convergence guarantees and bridge empirical advancements with theoretical insights. By providing a rigorous yet accessible treatment, we aim to equip researchers and practitioners with the necessary tools to effectively apply flow-based generative models in signal processing and machine learning.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 33 of its 48 references that are in the map. First posted on arXiv 19 Feb 2025.
Builds on
33 of 48 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2016Density estimation using Real NVPcited by 2,042
- 2023Consistency Modelscited by 1,822
- 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,545
- 2022Diffusion Posterior Sampling for General Noisy Inverse Problemscited by 1,416
- 2014NICE: Non-linear Independent Components Estimationcited by 1,058
- 2022Building Normalizing Flows with Stochastic Interpolantscited by 995
- 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
21 more
- 2024Flow Matching Guide and Codecited by 301
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
- 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transportcited by 283
- 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 170
- 2023The probability flow ODE is provably fastcited by 146
- 2024D-Flow: Differentiating through Flows for Controlled Generationcited by 122
- 2020Telescoping Density-Ratio Estimationcited by 108
- 2019A Machine Learning Framework for Solving High-Dimensional Mean Field Game and Mean Field Control Problemscited by 97
- 2023Error Bounds for Flow Matching Methodscited by 91
- 2021Large-Scale Wasserstein Gradient Flowscited by 77
- 2021Density Ratio Estimation via Infinitesimal Classificationcited by 61
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
- 2021Variational Wasserstein gradient flowcited by 53
- 2023Stochastic Optimal Control Matchingcited by 40
- 2022Normalizing flow neural networks by JKO schemecited by 39
- 2023Convergence of flow-based generative models via proximal gradient descent in Wasserstein spacecited by 34
- 2023Distribution learning via neural differential equations: a nonparametric statistical perspectivecited by 22
- 2022Taming Hyperparameter Tuning in Continuous Normalizing Flows Using the JKO Schemecited by 17
- 2023Computing high-dimensional optimal transport by flow neural networkscited by 8
- 2022Invertible Neural Networks for Graph Predictioncited by 6
- 2024Local Flow Matching Generative Modelscited by 5
Built on by
Citing papers per year: 2025: 2.
2 papers.