From Optimal Transport to Discrepancy
Not on the map. Why?
Abstract (arXiv)
A common way to quantify the ,,distance'' between measures is via their discrepancy, also known as maximum mean discrepancy (MMD). Discrepancies are related to Sinkhorn divergences S_varepsilon with appropriate cost functions as varepsilon → ∞. In the opposite direction, if varepsilon → 0, Sinkhorn divergences approach another important distance between measures, namely the Wasserstein distance or more generally optimal transport ,,distance''. In this chapter, we investigate the limiting process for arbitrary measures on compact sets and Lipschitz continuous cost functions. In particular, we are interested in the behavior of the corresponding optimal potentials hat varphi_varepsilon, hat psi_varepsilon and hat varphiK appearing in the dual formulation of the Sinkhorn divergences and discrepancies, respectively. While part of the results are known, we provide rigorous proofs for some relations which we have not found in this generality in the literature. Finally, we demonstrate the limiting process by numerical examples and show the behavior of the distances when used for the approximation of measures by point measures in a process called dithering.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 5; 2024: 1; 2025: 0; 2026: 1.
7 papers.
- 2023Generative Sliced MMD Flows with Riesz Kernelscited by 36
- 2023Learning from small data sets: Patch-based regularizers in inverse problems for image reconstructioncited by 9
- 2023On the Effect of Initialization: The Scaling Path of 2-Layer Neural Networkscited by 3
- 2024Transfer Operators from Batches of Unpaired Points via Entropic Transport Kernelscited by 2
- 2023Soft Quantization using Entropic Regularizationcited by 1
- 2023Arbitrary Distributions Mapping via SyMOT-Flow: A Flow-based Approach Integrating Maximum Mean Discrepancy and Optimal Transportcited by 0
- 2026Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithmscited by 0
- 2026Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms11 Aug 2026
- 2024Transfer Operators from Batches of Unpaired Points via Entropic Transport Kernels13 Feb 2024
- 2023Learning from small data sets: Patch-based regularizers in inverse problems for image reconstruction27 Dec 2023
- 2023Soft Quantization using Entropic Regularization8 Sep 2023
- 2023Arbitrary Distributions Mapping via SyMOT-Flow: A Flow-based Approach Integrating Maximum Mean Discrepancy and Optimal Transport26 Aug 2023
- 2023Generative Sliced MMD Flows with Riesz Kernels19 May 2023
- 2023On the Effect of Initialization: The Scaling Path of 2-Layer Neural Networks31 Mar 2023