mlsanityData to 7 Oct 2026

Turning Normalizing Flows into Monge Maps with Geodesic Gaussian Preserving Flows

arXiv 2209.10873 ↗First posted 22 Sep 2022cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Normalizing Flows (NF) are powerful likelihood-based generative models that are able to trade off between expressivity and tractability to model complex densities. A now well established research avenue leverages optimal transport (OT) and looks for Monge maps, i.e. models with minimal effort between the source and target distributions. This paper introduces a method based on Brenier's polar factorization theorem to transform any trained NF into a more OT-efficient version without changing the final density. We do so by learning a rearrangement of the source (Gaussian) distribution that minimizes the OT cost between the source and the final density. We further constrain the path leading to the estimated Monge map to lie on a geodesic in the space of volume-preserving diffeomorphisms thanks to Euler's equations. The proposed method leads to smooth flows with reduced OT cost for several existing models without affecting the model performance.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 29 of its 53 references that are in the map. First posted on arXiv 22 Sep 2022.

Builds on

29 of 53 references.

References · 29

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  3. 2022Generative Adversarial Networkscited by 5,603
  4. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  5. 2018Neural Ordinary Differential Equationscited by 3,733
  6. 2015Variational Inference with Normalizing Flowscited by 2,161
  7. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
  8. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
  9. 2014NICE: Non-linear Independent Components Estimationcited by 1,052
  10. 2018Computational Optimal Transportcited by 765
  11. 2017Masked Autoregressive Flow for Density Estimationcited by 680
  12. 2018Disentangling by Factorisingcited by 614
17 more
  1. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 584
  2. 2016Input Convex Neural Networkscited by 407
  3. 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 381
  4. 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
  5. 2018Neural Autoregressive Flowscited by 207
  6. 2019Optimal transport mapping via input convex neural networkscited by 202
  7. 2018Isolating Sources of Disentanglement in Variational Autoencoderscited by 167
  8. 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
  9. 2022Neural Optimal Transportcited by 123
  10. 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
  11. 2019Unconstrained Monotonic Neural Networkscited by 91
  12. 2020Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimizationcited by 89
  13. 2019Block Neural Autoregressive Flowcited by 62
  14. 2018Monge-Amp`ere Flow for Generative Modelingcited by 33
  15. 2019Potential Flow Generator with L2 Optimal Transport Regularity for Generative Modelscited by 31
  16. 2020Learning normalizing flows from Entropy-Kantorovich potentialscited by 18
  17. 2020A Principle of Least Action for the Training of Neural Networkscited by 8

Built on by

Cited by year

Citing papers per year: 2023: 5; 2024: 1.

6 papers.