Stability and Sample Complexity of Divergence Regularized Optimal Transport

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bayraktar, Erhan, Eckstein, Stephan, Zhang, Xin
Formato: Preprint
Publicado: 2022
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866929210544619520
author Bayraktar, Erhan
Eckstein, Stephan
Zhang, Xin
author_facet Bayraktar, Erhan
Eckstein, Stephan
Zhang, Xin
contents We study stability and sample complexity properties of divergence regularized optimal transport (DOT). First, we obtain quantitative stability results for optimizers of DOT measured in Wasserstein distance, which are applicable to a wide class of divergences and simultaneously improve known results for entropic optimal transport. Second, we study the case of sample complexity, where the DOT problem is approximated using empirical measures of the marginals. We show that divergence regularization can improve the corresponding convergence rate compared to unregularized optimal transport. To this end, we prove upper bounds which exploit both the regularity of cost function and divergence functional, as well as the intrinsic dimension of the marginals. Along the way, we establish regularity properties of dual optimizers of DOT, as well as general limit theorems for empirical measures with suitable classes of test functions.
format Preprint
id arxiv_https___arxiv_org_abs_2212_00367
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Stability and Sample Complexity of Divergence Regularized Optimal Transport
Bayraktar, Erhan
Eckstein, Stephan
Zhang, Xin
Optimization and Control
Probability
90C25, 49N05
We study stability and sample complexity properties of divergence regularized optimal transport (DOT). First, we obtain quantitative stability results for optimizers of DOT measured in Wasserstein distance, which are applicable to a wide class of divergences and simultaneously improve known results for entropic optimal transport. Second, we study the case of sample complexity, where the DOT problem is approximated using empirical measures of the marginals. We show that divergence regularization can improve the corresponding convergence rate compared to unregularized optimal transport. To this end, we prove upper bounds which exploit both the regularity of cost function and divergence functional, as well as the intrinsic dimension of the marginals. Along the way, we establish regularity properties of dual optimizers of DOT, as well as general limit theorems for empirical measures with suitable classes of test functions.
title Stability and Sample Complexity of Divergence Regularized Optimal Transport
topic Optimization and Control
Probability
90C25, 49N05
url https://arxiv.org/abs/2212.00367