Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Computational Optimal Transport
This short book reviews OT with a bias toward numerical methods and their applications in data sciences, and sheds lights on the theoretical properties of OT that make it particularly useful for some of these applications.
Iterative Bregman Projections for Regularized Transportation Problems
- J. Benamou, G. Carlier, Marco Cuturi, Luca Nenna, G. Peyré
- MathematicsSIAM J. Sci. Comput.
- 16 December 2014
It is shown that for many problems related to optimal transport, the set of linear constraints can be split in an intersection of a few simple constraints, for which the projections can be computed in closed form.
Wasserstein Barycenter and Its Application to Texture Mixing
A new definition of the averaging of discrete probability distributions as a barycenter over the Monge-Kantorovich optimal transport space is proposed and a new fast gradient descent algorithm is introduced to compute Wasserstein barycenters of point clouds.
Interpolating between Optimal Transport and MMD using Sinkhorn Divergences
- Jean Feydy, Thibault Séjourné, François-Xavier Vialard, S. Amari, A. Trouvé, G. Peyré
- Computer ScienceAISTATS
- 18 October 2018
This paper studies the Sinkhorn Divergences, a family of geometric divergences that interpolates between MMD and OT, and provides theoretical guarantees for positivity, convexity and metrization of the convergence in law.
Learning Generative Models with Sinkhorn Divergences
This paper presents the first tractable computational method to train large scale generative models using an optimal transport loss, and tackles three issues by relying on two key ideas: entropic smoothing, which turns the original OT loss into one that can be computed using Sinkhorn fixed point iterations; and algorithmic (automatic) differentiation of these iterations.
Gromov-Wasserstein Averaging of Kernel and Distance Matrices
This paper presents a new technique for computing the barycenter of a set of distance or kernel matrices, which define the interrelationships between points sampled from individual domains, and provides a fast iterative algorithm for the resulting nonconvex optimization problem.
Sliced and Radon Wasserstein Barycenters of Measures
- Nicolas Bonneel, Julien Rabin, G. Peyré, H. Pfister
- Computer Science, MathematicsJournal of Mathematical Imaging and Vision
Two approaches to compute barycenters of measures using 1-D Wasserstein distances along radial projections of the input measures using the Radon transform are detailed.
Stochastic Optimization for Large-scale Optimal Transport
A new class of stochastic optimization algorithms to cope with large-scale problems routinely encountered in machine learning applications, based on entropic regularization of the primal OT problem, which results in a smooth dual optimization optimization which can be addressed with algorithms that have a provably faster convergence.
Computational Optimal Transport: With Applications to Data Science
Computational Optimal Transport presents an overview of the main theoretical insights that support the practical effectiveness of OT before explaining how to turn these insights into fast computational schemes.
A Generalized Forward-Backward Splitting
This paper introduces the generalized forward-backward splitting algorithm for minimizing convex functions of the form F + G_i, and proves its convergence in infinite dimension, and its robustness to errors on the computation of the proximity operators and of the gradient of $F$.