Asymptotics for semi-discrete entropic optimal transport
Not on the map. Why?
Abstract (arXiv)
We compute exact second-order asymptotics for the cost of an optimal solution to the entropic optimal transport problem in the continuous-to-discrete, or semi-discrete, setting. In contrast to the discrete-discrete or continuous-continuous case, we show that the first-order term in this expansion vanishes but the second-order term does not, so that in the semi-discrete setting the difference in cost between the unregularized and regularized solution is quadratic in the inverse regularization parameter, with a leading constant that depends explicitly on the value of the density at the points of discontinuity of the optimal unregularized map between the measures. We develop these results by proving new pointwise convergence rates of the solutions to the dual problem, which may be of independent interest.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Jun 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 2; 2025: 3; 2026: 2.
14 papers.
Sort:
- 2021Entropic estimation of optimal transport mapscited by 87
- 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete casecited by 20
- 2022An improved central limit theorem and fast convergence rates for entropic transportation costscited by 18
- 2023Lower Complexity Adaptation for Empirical Entropic Optimal Transportcited by 12
- 2022Convergence Rates for Regularized Optimal Transport via Quantizationcited by 11
- 2023Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithmcited by 8
- 2024Plug-in estimation of Schr"odinger bridgescited by 8
- 2025AlignFlow: Improving Flow-based Generative Models with Semi-Discrete Optimal Transportcited by 6
- 2021Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal Transportcited by 5
- 2024Semi-Discrete Optimal Transport: Nearly Minimax Estimation With Stochastic Gradient Descent and Adaptive Entropic Regularizationcited by 0
- 2025Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Ratecited by 0
- 2025Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transportcited by 0
- 2026Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter29 Aug 2026
- 2026Optimal Transport under Group Fairness Constraints12 Jan 2026
- 2025Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport31 Oct 2025
- 2025Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Rate29 Oct 2025
- 2025AlignFlow: Improving Flow-based Generative Models with Semi-Discrete Optimal Transport16 Oct 2025
- 2024Plug-in estimation of Schr"odinger bridges21 Aug 2024
- 2024Semi-Discrete Optimal Transport: Nearly Minimax Estimation With Stochastic Gradient Descent and Adaptive Entropic Regularization23 May 2024
- 2023Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm7 Nov 2023
- 2023Lower Complexity Adaptation for Empirical Entropic Optimal Transport23 Jun 2023
- 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete case26 Jan 2023
- 2022Convergence Rates for Regularized Optimal Transport via Quantization30 Aug 2022
- 2022An improved central limit theorem and fast convergence rates for entropic transportation costs19 Apr 2022
2 more
- 2021Entropic estimation of optimal transport mapscited by 87
- 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete casecited by 20
- 2022An improved central limit theorem and fast convergence rates for entropic transportation costscited by 18
- 2023Lower Complexity Adaptation for Empirical Entropic Optimal Transportcited by 12
- 2022Convergence Rates for Regularized Optimal Transport via Quantizationcited by 11
- 2023Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithmcited by 8
- 2024Plug-in estimation of Schr"odinger bridgescited by 8
- 2025AlignFlow: Improving Flow-based Generative Models with Semi-Discrete Optimal Transportcited by 6
- 2021Nearly Tight Convergence Bounds for Semi-discrete Entropic Optimal Transportcited by 5
- 2024Semi-Discrete Optimal Transport: Nearly Minimax Estimation With Stochastic Gradient Descent and Adaptive Entropic Regularizationcited by 0
- 2025Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Ratecited by 0
- 2025Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transportcited by 0
12 most cited of 14 All 14 (JSON)
- 2026Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter29 Aug 2026
- 2026Optimal Transport under Group Fairness Constraints12 Jan 2026
- 2025Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport31 Oct 2025
- 2025Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Rate29 Oct 2025
- 2025AlignFlow: Improving Flow-based Generative Models with Semi-Discrete Optimal Transport16 Oct 2025
- 2024Plug-in estimation of Schr"odinger bridges21 Aug 2024
- 2024Semi-Discrete Optimal Transport: Nearly Minimax Estimation With Stochastic Gradient Descent and Adaptive Entropic Regularization23 May 2024
- 2023Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm7 Nov 2023
- 2023Lower Complexity Adaptation for Empirical Entropic Optimal Transport23 Jun 2023
- 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete case26 Jan 2023
- 2022Convergence Rates for Regularized Optimal Transport via Quantization30 Aug 2022
- 2022An improved central limit theorem and fast convergence rates for entropic transportation costs19 Apr 2022
12 newest of 14 All 14 (JSON)