Papers › Estimation of entropy-regularized optimal transport maps between non-compactly...
Estimation of entropy-regularized optimal transport maps between non-compactly supported measures
Matthew Werenski, James M. Murphy, Shuchin Aeron
This paper addresses the problem of estimating entropy-regularized optimal transport (EOT) maps with squared-Euclidean cost between source and target measures that are subGaussian. In the case that the target measure is compactly supported or strongly log-concave, we show that for a recently proposed in-sample estimator, the expected squared L²-error decays at least as fast as O(n^(-1/3)) where n is the sample size. For the general subGaussian case we show that the expected L¹-error decays at least as fast as O(n^(-1/6)), and in both cases we have polynomial dependence on the regularization parameter. While these results are suboptimal compared to known results in the case of compactness of both the source and target measures (squared L²-error converging at a rate O(n⁻¹)) and for when the source is subGaussian while the target is compactly supported (squared L²-error converging at a rate O(n^(-1/2))), their importance lie in eliminating the compact support requirements. The proof technique makes use of a bias-variance decomposition where the variance is controlled using standard concentration of measure results and the bias is handled by T1-transport inequalities along with sample complexity results in estimation of EOT cost under subGaussian assumptions. Our experimental results point to a looseness in controlling the variance terms and we conclude by posing several open problems.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections