Abstract

The approximation of probability measures on compact metric spaces and in particular on Riemannian manifolds by 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 unit interval by such curves. Using the discrepancy as distance between measures, we prove optimal approximation rates in terms of the curve’s length and Lipschitz constant. 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 unit 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 R^3 and the Grassmannian of all 2-dimensional linear subspaces of {mathbb {R}}^4. Our algorithm of choice is a conjugate gradient method on these manifolds, which incorporates second-order information. For efficient gradient and Hessian evaluations within the algorithm, we approximate the given measures by truncated Fourier series and use fast Fourier transform techniques on these manifolds.

Highlights

  • The approximation of probability measures by atomic or empirical ones based on their discrepancies is a well examined problem in approximation and complexity theoryCommunicated by Alan Edelman

  • Note that measures supported on continuous curves of finite length can be equivalently characterized by push-forward measures of probability measures by Lipschitz curves

  • We provided approximation results for general probability measures on compact Ahlfors d-regular metric spaces X by (i) measures supported on continuous curves of finite length, which are pushforward measures of probability measures on [0, 1] by Lipschitz curves; (ii) push-forward measures of absolutely continuous probability measures on [0, 1] by Lipschitz curves; (iii) push-forward measures of the Lebesgue measure on [0, 1] by Lipschitz curves

Read more

Summary

Introduction

The approximation of probability measures by atomic or empirical ones based on their discrepancies is a well examined problem in approximation and complexity theoryCommunicated by Alan Edelman. The approximation of probability measures by atomic or empirical ones based on their discrepancies is a well examined problem in approximation and complexity theory. Optimal Transport (OT) and in particular Wasserstein distances have emerged as powerful tools to compare probability measures in recent years, see [24,81] and the references therein. The rates for approximating probability measures by atomic or empirical ones with respect to Wasserstein distances depend on the dimension of the underlying spaces, see [21,58]. Approximation rates based on discrepancies can be given independently of the dimension [67], i.e., they do not suffer from the curse of dimensionality. We should keep in mind that the computation of discrepancies does not involve a minimization problem, which is a major drawback of OT and Sinkhorn divergences. Discrepancies admit a simple description in Fourier domain and the use of fast Fourier transforms is possible, leading to better scalability than the aforementioned methods

Objectives
Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.