mlsanityData to 14 Oct 2026

Neural Wasserstein Gradient Flows for Maximum Mean Discrepancies with Riesz Kernels

arXiv 2301.11624 ↗First posted 27 Jan 2023cs.LG math.OC math.PRcited by 9

Not on the map. Why?

Abstract (arXiv)

Wasserstein gradient flows of maximum mean discrepancy (MMD) functionals with non-smooth Riesz kernels show a rich structure as singular measures can become absolutely continuous ones and conversely. In this paper we contribute to the understanding of such flows. We propose to approximate the backward scheme of Jordan, Kinderlehrer and Otto for computing such Wasserstein gradient flows as well as a forward scheme for so-called Wasserstein steepest descent flows by neural networks (NNs). Since we cannot restrict ourselves to absolutely continuous measures, we have to deal with transport plans and velocity plans instead of usual transport maps and velocity fields. Indeed, we approximate the disintegration of both plans by generative NNs which are learned with respect to appropriate loss functions. In order to evaluate the quality of both neural schemes, we benchmark them on the interaction energy. Here we provide analytic formulas for Wasserstein schemes starting at a Dirac measure and show their convergence as the time step size tends to zero. Finally, we illustrate our neural MMD flows by numerical examples.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 30 of its 54 references that are in the map. First posted on arXiv 27 Jan 2023.

Builds on

30 of 54 references.

References · 30

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  4. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
  5. 2016Input Convex Neural Networkscited by 414
  6. 2020Stochastic Normalizing Flowscited by 157
  7. 2019Maximum Mean Discrepancy Gradient Flowcited by 127
  8. 2022Neural Optimal Transportcited by 126
  9. 2020Flows for simultaneous manifold learning and density estimationcited by 118
  10. 2021Proximal Optimal Transport Modeling of Population Dynamicscited by 93
  11. 2021Large-Scale Wasserstein Gradient Flowscited by 77
  12. 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
18 more
  1. 2021Variational Wasserstein gradient flowcited by 53
  2. 2020Refining Deep Generative Models via Discriminator Gradient Flowcited by 45
  3. 2021KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Supportcited by 37
  4. 2019Deep Generative Learning via Variational Gradient Flowcited by 32
  5. 2021Stochastic Normalizing Flows for Inverse Problems: a Markov Chains Viewpointcited by 32
  6. 2021Generalized Normalizing Flows via Markov Chainscited by 23
  7. 2021Efficient Gradient Flows in Sliced-Wasserstein Spacecited by 21
  8. 2022Particle-based Variational Inference with Preconditioned Functional Gradient Flowcited by 20
  9. 2021Neural Variational Gradient Descentcited by 19
  10. 2020Estimating Barycenters of Measures in High Dimensionscited by 18
  11. 2022Wasserstein Steepest Descent Flows of Discrepancies with Riesz Kernelscited by 16
  12. 2021Wasserstein Proximal of GANscited by 15
  13. 2021The Deep Minimizing Movement Schemecited by 15
  14. 2018Optimal transport natural gradient for statistical manifolds with continuous sample spacecited by 14
  15. 2020Large-Scale Optimal Transport via Adversarial Training with Cycle-Consistencycited by 14
  16. 2019Kernelized Wasserstein Natural Gradientcited by 12
  17. 2023Wasserstein Gradient Flows of the Discrepancy with Distance Kernel on the Linecited by 6
  18. 2019Curve Based Approximation of Measures on Manifolds by Discrepancy Minimizationcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 4; 2025: 1; 2026: 1.

9 papers.