English
Related papers

Related papers: Entropy-Regularized $2$-Wasserstein Distance betwe…

200 papers

This work studies the entropic regularization formulation of the 2-Wasserstein distance on an infinite-dimensional Hilbert space, in particular for the Gaussian setting. We first present the Minimum Mutual Information property, namely the…

Machine Learning · Statistics 2022-03-15 Minh Ha Quang

This work studies the convergence and finite sample approximations of entropic regularized Wasserstein distances in the Hilbert space setting. Our first main result is that for Gaussian measures on an infinite-dimensional Hilbert space,…

Machine Learning · Statistics 2021-02-16 Minh Ha Quang

Entropy regularization in optimal transport (OT) has been the driver of many recent interests for Wasserstein metrics and barycenters in machine learning. It allows to keep the appealing geometrical properties of the unregularized…

Machine Learning · Statistics 2020-06-05 Hicham Janati , Marco Cuturi , Alexandre Gramfort

The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces and provides a natural framework for aligning heterogeneous datasets. Alas, as exact computation of GW alignment is NP hard, entropic regularization…

Optimization and Control · Mathematics 2024-01-11 Gabriel Rioux , Ziv Goldfeld , Kengo Kato

The adapted Wasserstein distance is a metric for quantifying distributional uncertainty and assessing the sensitivity of stochastic optimization problems on time series data. A computationally efficient alternative to it, is provided by the…

Optimization and Control · Mathematics 2025-10-10 Beatrice Acciaio , Songyan Hou , Gudmund Pammer

\emph{Optimal Transport} (OT) has emerged as an important computational tool in machine learning and computer vision, providing a geometrical framework for studying probability measures. OT unfortunately suffers from the curse of…

Machine Learning · Computer Science 2021-02-08 Anton Mallasto

This work studies finite sample approximations of the exact and entropic regularized Wasserstein distances between centered Gaussian processes and, more generally, covariance operators of functional random processes. We first show that…

Machine Learning · Statistics 2021-04-27 Minh Ha Quang

The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…

Statistics Theory · Mathematics 2019-11-05 Jérémie Bigot , Elsa Cazelles , Nicolas Papadakis

Generative Adversarial Networks are a popular method for learning distributions from data by modeling the target distribution as a function of a known distribution. The function, often referred to as the generator, is optimized to minimize…

Machine Learning · Computer Science 2021-11-03 Daria Reshetova , Yikun Bai , Xiugang Wu , Ayfer Ozgur

Gaussian mixture distributions are commonly employed to represent general probability distributions. Despite the importance of using Gaussian mixtures for uncertainty estimation, the entropy of a Gaussian mixture cannot be calculated…

Machine Learning · Statistics 2025-01-23 Takashi Furuya , Hiroyuki Kusumoto , Koichi Taniguchi , Naoya Kanno , Kazuma Suetake

Although optimal transport (OT) problems admit closed form solutions in a very few notable cases, e.g. in 1D or between Gaussians, these closed forms have proved extremely fecund for practitioners to define tools inspired from the OT…

Statistics Theory · Mathematics 2020-12-15 Hicham Janati , Boris Muzellec , Gabriel Peyré , Marco Cuturi

We study the computation of doubly regularized Wasserstein barycenters, a recently introduced family of entropic barycenters governed by inner and outer regularization strengths. Previous research has demonstrated that various…

Optimization and Control · Mathematics 2023-07-26 Lénaïc Chizat , Tomas Vaškevičius

The squared Wasserstein distance is a natural quantity to compare probability distributions in a non-parametric setting. This quantity is usually estimated with the plug-in estimator, defined via a discrete optimal transport problem which…

Optimization and Control · Mathematics 2020-10-30 Lenaic Chizat , Pierre Roussillon , Flavien Léger , François-Xavier Vialard , Gabriel Peyré

Wasserstein barycentres represent average distributions between multiple probability measures for the Wasserstein distance. The numerical computation of Wasserstein barycentres is notoriously challenging. A common approach is to use…

Numerical Analysis · Mathematics 2026-03-30 Eloi Tanguy , Julie Delon , Nathaël Gozlan

We study the problem of quantifying how far an empirical distribution deviates from Gaussianity under the framework of optimal transport. By exploiting the cone geometry of the relative translation invariant quadratic Wasserstein space, we…

Machine Learning · Computer Science 2026-02-02 Binshuai Wang , Peng Wei

This work studies the Geometric Jensen-Shannon divergence, based on the notion of geometric mean of probability measures, in the setting of Gaussian measures on an infinite-dimensional Hilbert space. On the set of all Gaussian measures…

Probability · Mathematics 2025-06-13 Minh Ha Quang , Frank Nielsen

We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization…

Statistics Theory · Mathematics 2020-01-29 Jing Lei

In this paper we consider the space of those probability distributions which maximize the $q$-R\'enyi entropy. These distributions have the same parameter space for every $q$, and in the $q=1$ case these are the normal distributions. Some…

Probability · Mathematics 2017-08-24 Attila Andai

The space of Gaussian measures on a Euclidean space is geodesically convex in the $L^2$-Wasserstein space. This space is a finite dimensional manifold since Gaussian measures are parameterized by means and covariance matrices. By…

Differential Geometry · Mathematics 2009-02-11 Asuka Takatsu

This work presents several expected generalization error bounds based on the Wasserstein distance. More specifically, it introduces full-dataset, single-letter, and random-subset bounds, and their analogues in the randomized subsample…

Machine Learning · Statistics 2022-03-29 Borja Rodríguez-Gálvez , Germán Bassi , Ragnar Thobaben , Mikael Skoglund
‹ Prev 1 2 3 10 Next ›