We analyze a number of natural estimators for the optimal transport map between two distributions and show that they are minimax optimal. We adopt the plugin approach: our estimators are simply optimal couplings between measures derived from our observations, appropriately extended so that they define functions on $\mathbb{R}^d$. When the underlying map is assumed to be Lipschitz, we show that computing the optimal coupling between the empirical measures, and extending it using linear smoothers, already gives a minimax optimal estimator. When the underlying map enjoys higher regularity, we show that the optimal coupling between appropriate nonparametric density estimates yields faster rates. Our work also provides new bounds on the risk of ...
Cette thèse s'intéresse au problème du transport optimal, en particulier aux propriétés de régularit...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...
International audienceIn this paper we study the BV regularity for solutions of variational problems...
It was recently shown that under smoothness conditions, the squared Wasserstein distance between two...
International audienceThe problem of estimating Wasserstein distances between two densities living i...
Over the past few years, optimal transport has gained popularity in machine learning as a way to com...
This thesis deals with the optimal transport problem, in particular with regularity properties share...
The study of the optimal transport problem allows to define metrics on spaces of probability measure...
Monge map refers to the optimal transport map between two probability distributions and provides a p...
We develop a computationally tractable method for estimating the optimal map between two distributio...
This thesis is devoted to the regularity of optimal transport maps. We provide new results on this p...
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently...
We propose a simple subsampling scheme for fast randomized approximate computation of optimal transp...
We propose a new method to estimate Wasserstein distances and optimal transport plans between two pr...
This paper introduces the first statistically consistent estimator of the optimal transport map betw...
Cette thèse s'intéresse au problème du transport optimal, en particulier aux propriétés de régularit...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...
International audienceIn this paper we study the BV regularity for solutions of variational problems...
It was recently shown that under smoothness conditions, the squared Wasserstein distance between two...
International audienceThe problem of estimating Wasserstein distances between two densities living i...
Over the past few years, optimal transport has gained popularity in machine learning as a way to com...
This thesis deals with the optimal transport problem, in particular with regularity properties share...
The study of the optimal transport problem allows to define metrics on spaces of probability measure...
Monge map refers to the optimal transport map between two probability distributions and provides a p...
We develop a computationally tractable method for estimating the optimal map between two distributio...
This thesis is devoted to the regularity of optimal transport maps. We provide new results on this p...
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently...
We propose a simple subsampling scheme for fast randomized approximate computation of optimal transp...
We propose a new method to estimate Wasserstein distances and optimal transport plans between two pr...
This paper introduces the first statistically consistent estimator of the optimal transport map betw...
Cette thèse s'intéresse au problème du transport optimal, en particulier aux propriétés de régularit...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...
International audienceIn this paper we study the BV regularity for solutions of variational problems...