Approximation rates of entropic maps in semidiscrete optimal transport

Entropic optimal transport offers a computationally tractable approximation to the classical problem. We study the approximation rate of the entropic optimal transport map (in approaching the Brenier map) when the regularization parameter ε tends to zero in the semidiscrete setting, where the input measure is absolutely continuous while the output is finitely discrete. Previous work shows that the approximation rate is O(ε) under the L2-norm with respect to the input measure. In this work, we establish faster, O(ε2) rates up to polylogarithmic factors, under the dual Lipschitz norm, which is weaker than the L2-norm. For the said dual norm, the O(ε2) rate is sharp. As a corollary, we derive a central limit theorem for the entropic estimator for the Brenier map in the dual Lipschitz space when the regularization parameter tends to zero as the sample size increases.

Authors

Institutions

Publication Details

Journal
Electronic Communications in Probability
Published
2025-01-01
DOI
https://doi.org/10.1214/25-ecp682
Primary Topic
Geometric Analysis and Curvature Flows
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Approximation rates of entropic maps in semidiscrete optimal transport

Ritwik Sadhu, Ziv Goldfeld, Kengo Kato
Electronic Communications in Probability
Geometric Analysis and Curvature Flows
article

Approximation rates of entropic maps in semidiscrete optimal transport

Ritwik Sadhu, Ziv Goldfeld, Kengo Kato
article en

Abstract

Entropic optimal transport offers a computationally tractable approximation to the classical problem. We study the approximation rate of the entropic optimal transport map (in approaching the Brenier map) when the regularization parameter ε tends to zero in the semidiscrete setting, where the input measure is absolutely continuous while the output is finitely discrete. Previous work shows that the approximation rate is O(ε) under the L2-norm with respect to the input measure. In this work, we establish faster, O(ε2) rates up to polylogarithmic factors, under the dual Lipschitz norm, which is weaker than the L2-norm. For the said dual norm, the O(ε2) rate is sharp. As a corollary, we derive a central limit theorem for the entropic estimator for the Brenier map in the dual Lipschitz space when the regularization parameter tends to zero as the sample size increases.

Electronic Communications in ProbabilityVol. 30(none)
University of Washington (US), Cornell University (US)
National Science Foundation
Openalex Percentile: Top 89%
Geometric Analysis and Curvature Flows
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Approximation rates of entropic maps in semidiscrete optimal transport — Ritwik Sadhu, Ziv Goldfeld, et al. · Electronic Communications in Probability (2025) | TGRS Research Map | TGRS