arXiv Machine Learning July 22, 2026 By Razvan-Andrei Lascu, Mateusz B. Majka, David \v{S}i\v{s}ka, {\L}ukasz Szpruch

Linear convergence of proximal descent schemes on the Wasserstein space

Read the original on arXiv Machine Learning →

arXiv:2411. 15067v2 Announce Type: replace-cross Abstract: We investigate proximal descent methods, inspired by the minimizing movement scheme introduced by Jordan, Kinderlehrer and Otto, for optimizing entropy-regularized functionals on the Wasserstein space.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 29

Difference of Convex Programming in the Wasserstein Space with Applications to MMD Optimization

arXiv:2606. 27767v1 Announce Type: new Abstract: Optimizing functionals over the space of probability measures is now ubiquitous in machine learning.

By Cl\'ement Bonet, Pierre-Cyril Aubin-Frankowski, Youssef Mroueh

arXiv Machine Learning

Jun 9

Global Convergence of Wasserstein Policy Gradient for Entropy-Regularized Reinforcement Learning

arXiv:2605. 26078v3 Announce Type: replace Abstract: Wasserstein policy gradient (WPG) is a policy optimization method for reinforcement learning (RL) that exploits the optimal-transport geometry of action distributions.

By Zhaoyu Zhu, Rui Gao, Shuang Li

diffusion reinforcement-learning safety

arXiv Machine Learning

Jul 23

A convergence result of a continuous model of deep learning via a \L{}ojasiewicz--Simon inequality

arXiv:2311. 15365v3 Announce Type: replace Abstract: We study an idealized training process for deep neural networks in a continuous-depth, mean-field model in which each layer is parameterized by a probability measure on a Euclidean parameter space.

By Noboru Isobe

arXiv Machine Learning

Jun 3

Wasserstein Contraction of Coordinate Ascent Variational Inference

arXiv:2605. 30253v2 Announce Type: replace-cross Abstract: We study the contraction in Wasserstein distance of the coordinate ascent variational inference algorithm.

By Rocco Caprio, Adrien Corenflos, Sam Power

arXiv Machine Learning

Jun 30

Learning from samples: inverse problems over measures

arXiv:2505. 07124v3 Announce Type: replace Abstract: We study inverse problems where an unknown potential is observed only through samples from the measure it induces by a convex variational principle.

By Francisco Andrade, Gabriel Peyr\'e, Clarice Poon

arXiv Machine Learning

Jul 21

Scaling Limits of Constant-Stepsize SGD at Flat Minima

arXiv:2607. 16384v1 Announce Type: new Abstract: For stochastic gradient descent (SGD) with a constant stepsize $\alpha$, the invariant law of the iterates, centered at a minimizer, describes the behavior of the algorithm over long time horizons.

By Jingyi Zhang, Cheng Mao, Debankur Mukherjee

Related stories

Difference of Convex Programming in the Wasserstein Space with Applications to MMD Optimization

Global Convergence of Wasserstein Policy Gradient for Entropy-Regularized Reinforcement Learning

A convergence result of a continuous model of deep learning via a \L{}ojasiewicz--Simon inequality

Wasserstein Contraction of Coordinate Ascent Variational Inference

Learning from samples: inverse problems over measures

Scaling Limits of Constant-Stepsize SGD at Flat Minima