Curve Based Approximation of Measures on Manifolds by Discrepancy Minimization
Not on the map. Why?
Abstract (arXiv)
The approximation of probability measures on compact metric spaces and in particular on Riemannian manifoldsby atomic or empirical ones is a classical task in approximation and complexity theory with a wide range of applications. Instead of point measures we are concerned with the approximation by measures supported on Lipschitz curves. Special attention is paid to push-forward measures of Lebesgue measures on the interval by such curves. Using the discrepancy as distance between measures, we prove optimal approximation rates in terms of Lipschitz constants of curves. Having established the theoretical convergence rates, we are interested in the numerical minimization of the discrepancy between a given probability measure and the set of push-forward measures of Lebesgue measures on the interval by Lipschitz curves. We present numerical examples for measures on the 2- and 3-dimensional torus, the 2-sphere, the rotation group on mathbb R3 and the Grassmannian of all 2-dimensional linear subspaces of ℝ4. Our algorithm of choice is a conjugate gradient method on these manifolds which incorporates second-oder information. For efficiently computing the gradients and the Hessians within the algorithm, we approximate the given measures by truncated Fourier series and use fast Fourier transform techniques on these manifolds.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 1.
4 papers.
- 2024Wasserstein Gradient Flows for Moreau Envelopes of f-Divergences in Reproducing Kernel Hilbert Spacescited by 15
- 2023Neural Wasserstein Gradient Flows for Maximum Mean Discrepancies with Riesz Kernelscited by 9
- 2025Smoothed Distance Kernels for MMDs and Applications in Wasserstein Gradient Flowscited by 2
- 2026Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithmscited by 0
- 2026Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms11 Aug 2026
- 2025Smoothed Distance Kernels for MMDs and Applications in Wasserstein Gradient Flows10 Apr 2025
- 2024Wasserstein Gradient Flows for Moreau Envelopes of f-Divergences in Reproducing Kernel Hilbert Spaces7 Feb 2024
- 2023Neural Wasserstein Gradient Flows for Maximum Mean Discrepancies with Riesz Kernels27 Jan 2023