Discretization on high-dimensional domains
Martin Buhmann, Feng Dai, Yeli Niu

TL;DR
This paper develops a method for discretizing Lipschitz functions on high-dimensional metric spaces, providing bounds that outperform standard Monte Carlo methods, especially on spheres.
Contribution
It introduces a new discretization approach with explicit error bounds for Lipschitz functions on high-dimensional domains, including spheres, improving upon traditional Monte Carlo estimates.
Findings
Achieves error bounds of order N^{-1/2 - 3/(2β)} log^{1/2} N
Constant C is independent of the dimension d on spheres
Outperforms standard Monte Carlo error rates
Abstract
Let be a Borel probability measure on a compact path-connected metric space for which there exist constants such that for every open ball of radius . For a class of Lipschitz functions that piecewisely lie in a finite-dimensional subspace of continuous functions, we prove under certain mild conditions on the metric and the measure that for each positive integer , and each with , there exist points and real numbers such that for any , \begin{align*} & \left| \int_X \Phi (\rho (x, y)) g(y) \,d \mu (y) - \sum_{j = 1}^{ N} \lambda_j \Phi (\rho (x, y_j)) \right| \leq C N^{- \frac{1}{2} - \frac{3}{2\beta}} \sqrt{\log N}, \end{align*} where the constant …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
