We seek a generalization of regression and principle component analysis (PCA) in a metric space where data points are distributions metrized by the Wasserstein metric. We recast these analyses as multimarginal optimal transport problems. The particular formulation allows efficient computation, ensures existence of optimal solutions, and admits a probabilistic interpretation over the space of paths (line segments). Application of the theory to the interpolation of empirical distributions, images, power spectra, as well as assessing uncertainty in experimental designs, is envisioned
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal ma...
This dissertation develops a comprehensive statistical learning framework that is robust to (distrib...
We propose a new method to estimate Wasserstein distances and optimal transport plans between two pr...
This paper is concerned by statistical inference problems from a data set whose elements may be mode...
We present a novel class of projected methods to perform statistical analysis on a data set of proba...
This paper is concerned by statistical inference problems from a data set whose elements may be mode...
This paper is concerned by the statistical analysis of data sets whose elements are random histogram...
This open access book presents the key aspects of statistics in Wasserstein spaces, i.e. statistics ...
Comparing probability distributions is at the crux of many machine learning algorithms. Maximum Mean...
International audienceThis paper is concerned by the study of barycenters for random probability mea...
International audienceOptimal Transport (OT) defines geometrically meaningful "Wasserstein" distance...
The Wasserstein distance is an attractive tool for data analysis but statistical inference is hinder...
We address the problem of performing Principal Component Analysis over a family of probability measu...
The Perron–Frobenius and Koopman operators provide natural dual settings to investigate the dynamics...
Metric Learning has proved valuable in information retrieval and classification problems, with many ...
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal ma...
This dissertation develops a comprehensive statistical learning framework that is robust to (distrib...
We propose a new method to estimate Wasserstein distances and optimal transport plans between two pr...
This paper is concerned by statistical inference problems from a data set whose elements may be mode...
We present a novel class of projected methods to perform statistical analysis on a data set of proba...
This paper is concerned by statistical inference problems from a data set whose elements may be mode...
This paper is concerned by the statistical analysis of data sets whose elements are random histogram...
This open access book presents the key aspects of statistics in Wasserstein spaces, i.e. statistics ...
Comparing probability distributions is at the crux of many machine learning algorithms. Maximum Mean...
International audienceThis paper is concerned by the study of barycenters for random probability mea...
International audienceOptimal Transport (OT) defines geometrically meaningful "Wasserstein" distance...
The Wasserstein distance is an attractive tool for data analysis but statistical inference is hinder...
We address the problem of performing Principal Component Analysis over a family of probability measu...
The Perron–Frobenius and Koopman operators provide natural dual settings to investigate the dynamics...
Metric Learning has proved valuable in information retrieval and classification problems, with many ...
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal ma...
This dissertation develops a comprehensive statistical learning framework that is robust to (distrib...
We propose a new method to estimate Wasserstein distances and optimal transport plans between two pr...