Quantitative Stability of the Shadow for Wasserstein Projections and Sample Complexity

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Kim, Jakwang
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913045970681856
author Kim, Jakwang
author_facet Kim, Jakwang
contents In this paper, we study the stability of the shadow, a projection of a measure onto the set of couplings with respect to the Wasserstein distance. The shadow was introduced by \citet{Eckstein_Nutz_2022} to analyze the stability of the Sinkhorn algorithm, and was recently revisited by \citet{kim2026extensioncouplingprojectionoptimal} for statistical applications. Under mild conditions, we establish the bi-Hölder continuity of the shadow. As a consequence, we also derive the sample complexity of the shadow by combining smoothing techniques with recent results on the rate of convergence of empirical measures in Wasserstein distance. The key idea of the proof is twofold: first, a contraction property of the $L^p$ projection, recently used independently by \citet{kim2025stabilitywassersteinprojectionsconvex} and \citet{alfonsi2025wassersteinprojectionsconvexorder} to study the stability of projections onto the convex order cone in Wasserstein space; and second, the Hölder continuity of optimal transport maps established by \citet{Quantitative_stability_duke2023}, together with its recent extension by \citet{mischler2025quantitativestabilityoptimaltransport}.
format Preprint
id arxiv_https___arxiv_org_abs_2604_17711
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Quantitative Stability of the Shadow for Wasserstein Projections and Sample Complexity
Kim, Jakwang
Statistics Theory
Optimization and Control
Probability
60D05 (Primary), 49Q22 (Secondary)
In this paper, we study the stability of the shadow, a projection of a measure onto the set of couplings with respect to the Wasserstein distance. The shadow was introduced by \citet{Eckstein_Nutz_2022} to analyze the stability of the Sinkhorn algorithm, and was recently revisited by \citet{kim2026extensioncouplingprojectionoptimal} for statistical applications. Under mild conditions, we establish the bi-Hölder continuity of the shadow. As a consequence, we also derive the sample complexity of the shadow by combining smoothing techniques with recent results on the rate of convergence of empirical measures in Wasserstein distance. The key idea of the proof is twofold: first, a contraction property of the $L^p$ projection, recently used independently by \citet{kim2025stabilitywassersteinprojectionsconvex} and \citet{alfonsi2025wassersteinprojectionsconvexorder} to study the stability of projections onto the convex order cone in Wasserstein space; and second, the Hölder continuity of optimal transport maps established by \citet{Quantitative_stability_duke2023}, together with its recent extension by \citet{mischler2025quantitativestabilityoptimaltransport}.
title Quantitative Stability of the Shadow for Wasserstein Projections and Sample Complexity
topic Statistics Theory
Optimization and Control
Probability
60D05 (Primary), 49Q22 (Secondary)
url https://arxiv.org/abs/2604.17711