arXiv · 2206.13472
On the sample complexity of entropic optimal transport
Abstract
We study the sample complexity of entropic optimal transport in high dimensions using computationally efficient plug-in estimators. We significantly advance the state of the art by establishing dimension-free, parametric rates for estimating various quantities of interest, including the entropic regression function which is a natural analog to the optimal transport map. As an application, we propose a practical model for transfer learning based on entropic optimal transport and establish parametric rates of convergence for nonparametric regression and classification.
Explore related subjects
Keep this discovery
Philippe Rigollet, Austin J. Stromme. 2022-06-27. On the sample complexity of entropic optimal transport. https://arxiv.org/abs/2206.13472
Cite the original work for its findings. Save a collection to share your selection of sources.