Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal Transport
–arXiv.org Artificial Intelligence
We derive nearly tight and non-asymptotic convergence bounds for solutions of entropic semi-discrete optimal transport. These bounds quantify the stability of the dual solutions of the regularized problem (sometimes called Sinkhorn potentials) w.r.t. the regularization parameter, for which we ensure a better than Lipschitz dependence. Such facts may be a first step towards a mathematical justification of annealing or $\eps$-scaling heuristics for the numerical resolution of regularized semi-discrete optimal transport. Our results also entail a non-asymptotic and tight expansion of the difference between the entropic and the unregularized costs.
arXiv.org Artificial Intelligence
Oct-25-2021
- Country:
- Oceania > Australia
- New South Wales > Sydney (0.04)
- North America > United States
- California > Los Angeles County > Long Beach (0.04)
- Europe
- Spain > Canary Islands (0.04)
- Sweden > Stockholm
- Stockholm (0.04)
- France > Île-de-France
- Oceania > Australia
- Genre:
- Research Report > New Finding (0.34)
- Technology: