Rapid mixing of geodesic walks on manifolds with positive curvature

Type: Article

Publication Date: 2018-08-01

Citations: 19

DOI: https://doi.org/10.1214/17-aap1365

Abstract

We introduce a Markov chain for sampling from the uniform distribution on a Riemannian manifold $\mathcal{M}$, which we call the geodesic walk. We prove that the mixing time of this walk on any manifold with positive sectional curvature $C_{x}(u,v)$ bounded both above and below by $0<\mathfrak{m}_{2}\leq C_{x}(u,v)\leq\mathfrak{M}_{2}<\infty$ is $\mathcal{O}^{*}(\frac{\mathfrak{M}_{2}}{\mathfrak{m}_{2}})$. In particular, this bound on the mixing time does not depend explicitly on the dimension of the manifold. In the special case that $\mathcal{M}$ is the boundary of a convex body, we give an explicit and computationally tractable algorithm for approximating the exact geodesic walk. As a consequence, we obtain an algorithm for sampling uniformly from the surface of a convex body that has running time bounded solely in terms of the curvature of the body.

Locations

  • arXiv (Cornell University) - View - PDF
  • The Annals of Applied Probability - View - PDF

Similar Works

Action Title Year Authors
+ Rapid Mixing of Geodesic Walks on Manifolds with Positive Curvature 2016 Oren Mangoubi
Aaron Smith
+ Rapid Mixing of Geodesic Walks on Manifolds with Positive Curvature 2016 Oren Mangoubi
Aaron Smith
+ PDF Chat Efficient Sampling on Riemannian Manifolds via Langevin MCMC 2024 Xiang Cheng
Jingzhao Zhang
Suvrit Sra
+ PDF Chat Geodesic Walks in Polytopes 2022 Yin Tat Lee
Santosh Vempala
+ Efficient Random Walks on Riemannian Manifolds 2022 Simon Schwarz
Michael Herrmann
Anja Sturm
Max Wardetzky
+ Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative Curvature 2019 Navin Goyal
Abhishek Shetty
+ Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative Curvature 2019 Navin Goyal
Abhishek Shetty
+ Geodesic Walks in Polytopes 2016 Yin Tat Lee
Santosh Vempala
+ Positive Curvature and Hamiltonian Monte Carlo 2014 Christof Seiler
Simon Rubinstein‐Salzedo
Susan Holmes
+ PDF Chat Geodesic walks in polytopes 2017 Yin Tat Lee
Santosh Vempala
+ PDF Chat Curvature, concentration and error estimates for Markov chain Monte Carlo 2010 Aldéric Joulin
Yann Ollivier
+ PDF Chat Efficient Random Walks on Riemannian Manifolds 2023 Simon Schwarz
Michael Herrmann
Anja Sturm
Max Wardetzky
+ Large deviations for geodesic random walks 2019 Rik Versendaal
+ Convergence of the Riemannian Langevin Algorithm 2022 Khashayar Gatmiry
Santosh Vempala
+ Sampling with Barriers: Faster Mixing via Lewis Weights 2023 Khashayar Gatmiry
Jonathan A. Kelner
Santosh Vempala
+ Large deviations for geodesic random walks 2018 Rik Versendaal
+ Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster Polytope Volume Computation 2017 Lee Yin Tat
Sandeep Santosh
+ Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster Polytope Volume Computation 2017 Yin Tat Lee
Santosh Vempala
+ Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation 2018 Yin Tat Lee
Santosh Vempala
+ Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: Continuous dynamics 2021 Oren Mangoubi
Aaron Smith