中文

Nearly sharp comparison results for sliced and max-sliced Wasserstein distances

概率论 2026-08-13 v1 泛函分析 统计理论

摘要

We prove new comparison results between the Wasserstein distance and its sliced and max-sliced counterparts. First, we show that the H\"older exponent~2d+2\frac{2}{d+2} obtained by Bobkov and G\"otze for the max-sliced 1-Wasserstein distance on the unit ball is optimal for every d2d \geq 2, settling a question raised in their work. Second, we show that sharper comparisons are possible under stronger structural assumptions: if ν\nu is a discrete measure and the optimal coupling between μ\mu and ν\nu transports each point to a nearest atom of ν\nu, then Wp(μ,ν)CdKSWp,1(μ,ν)W_p(\mu, \nu) \leq C \sqrt{d}\, K \, \mathrm{SW}_{p,1}(\mu, \nu) for a universal constant CC, where the complexity parameter KK is always at most the number of atoms NN and can be substantially smaller. This complements a similar bound due to Park and Slep\v{c}ev. An analogous bound holds for the sliced Wasserstein distance based on kk-dimensional projections. Finally, using a construction from geometric discrepancy theory due to Chen and Travaglini, we prove that the linear dependence on KK in this bound cannot be improved, up to polylogarithmic factors.

引用

@article{arxiv.2608.13374,
  title  = {Nearly sharp comparison results for sliced and max-sliced Wasserstein distances},
  author = {Jonathan Niles-Weed and Jacob Shkrob},
  journal= {arXiv preprint arXiv:2608.13374},
  year   = {2026}
}