English

Wasserstein approximation schemes based on Voronoi partitions

Machine Learning 2024-07-26 v2 Machine Learning Numerical Analysis Numerical Analysis

Abstract

We consider structured approximation of measures in Wasserstein space Wp(Rd)\mathrm{W}_p(\mathbb{R}^d) for p[1,)p\in[1,\infty) using general measure approximants compactly supported on Voronoi regions derived from a scaled Voronoi partition of Rd\mathbb{R}^d. We show that if a full rank lattice Λ\Lambda is scaled by a factor of h(0,1]h\in(0,1], then approximation of a measure based on the Voronoi partition of hΛh\Lambda is O(h)O(h) regardless of dd or pp. We then use a covering argument to show that NN-term approximations of compactly supported measures is O(N1d)O(N^{-\frac1d}) which matches known rates for optimal quantizers and empirical measure approximation in most instances. Additionally, we generalize our construction to nonuniform Voronoi partitions, highlighting the flexibility and robustness of our approach for various measure approximation scenarios. Finally, we extend these results to noncompactly supported measures with sufficient decay. Our findings are pertinent to applications in computer vision and machine learning where measures are used to represent structured data such as images.

Cite

@article{arxiv.2310.09149,
  title  = {Wasserstein approximation schemes based on Voronoi partitions},
  author = {Keaton Hamm and Varun Khurana},
  journal= {arXiv preprint arXiv:2310.09149},
  year   = {2024}
}
R2 v1 2026-06-28T12:49:56.227Z