mlsanityData to 7 Oct 2026

Combining Wasserstein-1 and Wasserstein-2 proximals: robust manifold learning via well-posed generative flows

arXiv 2407.11901 ↗First posted 16 Jul 2024stat.ML cs.LG stat.COcited by 4

Not on the map. Why?

Abstract (arXiv)

We formulate well-posed continuous-time generative flows for learning distributions that are supported on low-dimensional manifolds through Wasserstein proximal regularizations of f-divergences. Wasserstein-1 proximal operators regularize f-divergences so that singular distributions can be compared. Meanwhile, Wasserstein-2 proximal operators regularize the paths of the generative flows by adding an optimal transport cost, i.e., a kinetic energy penalization. Via mean-field game theory, we show that the combination of the two proximals is critical for formulating well-posed generative flows. Generative flows can be analyzed through optimality conditions of a mean-field game (MFG), a system of a backward Hamilton-Jacobi (HJ) and a forward continuity partial differential equations (PDEs) whose solution characterizes the optimal generative flow. For learning distributions that are supported on low-dimensional manifolds, the MFG theory shows that the Wasserstein-1 proximal, which addresses the HJ terminal condition, and the Wasserstein-2 proximal, which addresses the HJ dynamics, are both necessary for the corresponding backward-forward PDE system to be well-defined and have a unique solution with provably linear flow trajectories. This implies that the corresponding generative flow is also unique and can therefore be learned in a robust manner even for learning high-dimensional distributions supported on low-dimensional manifolds. The generative flows are learned through adversarial training of continuous-time flows, which bypasses the need for reverse simulation. We demonstrate the efficacy of our approach for generating high-dimensional images without the need to resort to autoencoders or specialized architectures.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 17 of its 23 references that are in the map. First posted on arXiv 16 Jul 2024.

Builds on

17 of 23 references.

References · 17

  1. 2018Neural Ordinary Differential Equationscited by 3,733
  2. 2017Improved Training of Wasserstein GANscited by 2,223
  3. 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
  4. 2019Neural Stochastic Differential Equations: Deep Latent Gaussian Models in the Diffusion Limitcited by 168
  5. 2020Stochastic Normalizing Flowscited by 156
  6. 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
  7. 2019Distributionally Robust Optimization: A Reviewcited by 75
  8. 2019Potential Flow Generator with L2 Optimal Transport Regularity for Generative Modelscited by 31
  9. 2023A mean-field games laboratory for generative modelingcited by 28
  10. 2020ResNet After All? Neural ODEs and Their Numerical Solutioncited by 20
  11. 2022Structure-preserving GANscited by 17
  12. 2024Wasserstein proximal operators describe score-based generative models and resolve memorizationcited by 14
5 more
  1. 2024Score-based generative models are provably robust: an uncertainty quantification perspectivecited by 14
  2. 2023A kernel formula for regularized Wasserstein proximal operatorscited by 11
  3. 2022Lipschitz-regularized gradient flows and generative particle algorithms for high-dimensional scarce datacited by 8
  4. 2022Function-space regularized R'enyi divergencescited by 7
  5. 2021Moreau-Yosida f-divergencescited by 5

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 3.

4 papers.