Deep Residual Networks Learn the Geodesic Curve in the Wasserstein Space
arXiv:2102. 09235v3 Announce Type: replace Abstract: Recent studies revealed the mathematical connection between deep neural networks (DNNs) and dynamic systems.
This paper introduces a generative model that minimizes the second‑order Wasserstein loss (W₂) by solving a distribution‑dependent ordinary differential equation (ODE) whose dynamics involve the Kantorovich potential of the true data distribution and its current estimate. The authors prove that the time‑marginal laws of this ODE form a gradient flow for the W₂ loss, converging exponentially to the true data distribution, and propose an Euler scheme that recovers this gradient flow in the limit. An algorithm based on this scheme, combined with persistent training, is shown in experiments to outperform Wasserstein GANs in both low‑ and high‑dimensional settings when the level of persistent training is appropriately increased.
arXiv:2102. 09235v3 Announce Type: replace Abstract: Recent studies revealed the mathematical connection between deep neural networks (DNNs) and dynamic systems.
arXiv:2608.29647v1 Announce Type: new Abstract: To mitigate the time complexity of generative models, one-step generative models have recently emerged through direct mapping from noise to data in a s...
The paper presents Conditional Föllmer Flow, an ODE‑based deep generative approach for learning conditional distributions. Starting from a Gaussian, the flow approximates the target distribution near time 1, with Euler discretization and a neural‑network‑estimated velocity field. The authors prove convergence in Wasserstein‑2 distance and demonstrate superior performance on both nonparametric density estimation and image‑based tasks compared to existing methods.
The paper presents a convergence analysis of the Wasserstein proximal algorithm without requiring geodesic convexity of the objective functional. By assuming a Wasserstein analog of the Euclidean Polyak–Łojasiewicz inequality, the authors prove that the algorithm achieves unbiased, linear convergence, improving on previous rates that required strong geodesic convexity. The analysis is extended to inexact proximal steps for geodesically semiconvex objectives, and numerical experiments show faster convergence than noisy gradient descent on mean‑field neural networks.
arXiv:2506.04948v4 Announce Type: replace-cross Abstract: Wasserstein distributionally robust optimization offers a framework for model fitting in machine learning under potential shifts in the data...
arXiv:2607. 04738v1 Announce Type: cross Abstract: Reconstructing population dynamics is a central problem in the physical and data sciences.
arXiv:2509.19276v2 Announce Type: replace-cross Abstract: Solving ill-posed inverse problems requires powerful and flexible priors. We propose leveraging pretrained latent diffusion models for this t...
Reconstructing population dynamics is a central problem in the physical and data sciences. Often, the dynamics are modeled as a Wasserstein gradient flow (WGF): a curve of distributions driven by an energy functional.
The paper develops a statistical framework showing that empirical score matching can achieve minimax optimal performance for diffusion generative models when data lie on a low‑dimensional manifold. It establishes convergence rates for empirical risk minimization over constrained Sobolev classes and demonstrates that the resulting score estimators yield minimax optimal Wasserstein‑1 rates for the generated distribution, up to logarithmic factors. The analysis reveals that the statistical rates depend on the intrinsic dimension of the data manifold rather than its ambient dimension, providing conditions under which score‑based generative modeling generalizes rather than overfits.
The paper introduces a new optimal transport framework that uses the Barron energy—an intrinsic neural network complexity measure—instead of the traditional kinetic energy. By modeling transport as deep residual networks that map a reference distribution to a target distribution, the authors define a new metric on probability measures and analyze its properties for generative modeling. They demonstrate that diffusion generative models are suboptimal in this Barron geometry and explore how adaptivity can improve alternative generative approaches.
arXiv:2605.29713v2 Announce Type: replace-cross Abstract: This book provides a compact, derivation-oriented introduction to the mathematical foundations of modern generative artificial intelligence....
arXiv:2412. 20556v2 Announce Type: replace-cross Abstract: We study distributionally robust optimization (DRO) for robust inference when the worst-case distribution is continuous, leading to significant computational challenges due to the infinite-dimensional nature of the optimization problem.