Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stereographic Markov Chain Monte Carlo (2205.12112v2)

Published 24 May 2022 in stat.CO, stat.ME, and stat.ML

Abstract: High-dimensional distributions, especially those with heavy tails, are notoriously difficult for off-the-shelf MCMC samplers: the combination of unbounded state spaces, diminishing gradient information, and local moves results in empirically observed stickiness'' and poor theoretical mixing properties -- lack of geometric ergodicity. In this paper, we introduce a new class of MCMC samplers that map the original high-dimensional problem in Euclidean space onto a sphere and remedy these notorious mixing problems. In particular, we develop random-walk Metropolis type algorithms as well as versions of the Bouncy Particle Sampler that are uniformly ergodic for a large class of light and heavy-tailed distributions and also empirically exhibit rapid convergence in high dimensions. In the best scenario, the proposed samplers can enjoy theblessings of dimensionality'' that the convergence is faster in higher dimensions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. Subgeometric hypocoercivity for piecewise-deterministic markov process monte carlo methods. Electronic Journal of Probability, 26:1–26, 2021a.
  2. Hypocoercivity of piecewise deterministic markov process-monte carlo. The Annals of Applied Probability, 31(5):2478–2517, 2021b.
  3. Event-chain monte carlo algorithms for hard-sphere systems. Physical Review E, 80(5):056704, 2009.
  4. The zig-zag process and super-efficient sampling for bayesian analysis of big data. The Annals of Statistics, 47(3):1288–1320, 2019.
  5. High-dimensional scaling limits of piecewise deterministic sampling algorithms. The Annals of Applied Probability, 32(5):3361–3407, 2022.
  6. The bouncy particle sampler: A nonreversible rejection-free markov chain monte carlo method. Journal of the American Statistical Association, 113(522):855–867, 2018.
  7. Scaling limits for the transient phase of local Metropolis–Hastings algorithms. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2):253–268, 2005.
  8. Mcmc methods for functions: modifying old algorithms to make them faster. Statistical Science, 28(3):424–446, 2013.
  9. Harold Scott Macdonald Coxeter. Introduction to geometry. 1961.
  10. M. H. A. Davis. Piecewise-deterministic Markov processes: a general class of nondiffusion stochastic models. J. Roy. Statist. Soc. Ser. B, 46(3):353–388, 1984. ISSN 0035-9246. With discussion.
  11. Exponential ergodicity of the bouncy particle sampler. The Annals of Statistics, 47(3):1268–1287, 2019.
  12. Randomized hamiltonian monte carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates. The Annals of Applied Probability, 31(6):2612–2662, 2021.
  13. Exponential and uniform ergodicity of markov processes. The Annals of Probability, 23(4):1671–1691, 1995.
  14. Geometric ergodicity of the bouncy particle sampler. The Annals of Applied Probability, 30(5):2069–2098, 2020.
  15. Markov processes: Characterization and Convergence. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics. Wiley, New York, 1986. ISBN 0-471-08186-8. Characterization and convergence.
  16. Piecewise deterministic markov processes for continuous-time monte carlo. Statistical Science, 33(3):386–412, 2018.
  17. An introduction to the theory of higher-dimensional quasiconformal mappings, volume 216. American Mathematical Soc., 2017.
  18. Riemann manifold langevin and hamiltonian monte carlo methods. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 73(2):123–214, 2011.
  19. Geometric ergodicity of metropolis algorithms. Stochastic processes and their applications, 85(2):341–361, 2000.
  20. Convergence of heavy-tailed monte carlo markov chain algorithms. Scandinavian Journal of Statistics, 34(4):781–815, 2007.
  21. Variable transformation to obtain geometric ergodicity in the random-walk metropolis algorithm. The Annals of Statistics, pages 3050–3076, 2012.
  22. Kengo Kamatani. Efficient strategy for the markov chain monte carlo in high-dimension with heavy-tailed target probability distribution. Bernoulli, 24(4B):3711–3750, 2018.
  23. Dimension-independent markov chain monte carlo on the sphere. Scandinavian Journal of Statistics, 2021.
  24. Thomas Milton Liggett. Continuous time Markov processes: an introduction, volume 113. American Mathematical Soc., 2010.
  25. Rapid mixing of geodesic walks on manifolds with positive curvature. The Annals of Applied Probability, 28(4):2501–2543, 2018.
  26. Rates of convergence of the Hastings and Metropolis algorithms. The Annals of Statistics, 24(1):101–121, 1996.
  27. Markov chains and stochastic stability. Springer Science & Business Media, 2012.
  28. Projections of spherical brownian motion. Electronic Communications in Probability, 23:1–12, 2018.
  29. Yann Ollivier. Ricci curvature of markov chains on metric spaces. Journal of Functional Analysis, 256(3):810–864, 2009.
  30. A framework for adaptive mcmc targeting multimodal distributions. The Annals of Statistics, 48(5):2930–2952, 2020.
  31. Examples of adaptive mcmc. Journal of computational and graphical statistics, 18(2):349–367, 2009.
  32. Simple conditions for the convergence of the gibbs sampler and metropolis-hastings algorithms. Stochastic processes and their applications, 49(2):207–216, 1994.
  33. Geometric convergence and central limit theorems for multidimensional hastings and Metropolis algorithms. Biometrika, 83(1):95–110, 1996a.
  34. Exponential convergence of langevin distributions and their discrete approximations. Bernoulli, pages 341–363, 1996b.
  35. Weak convergence and optimal scaling of random walk Metropolis algorithms. The Annals of Applied Probability, 7(1):110–120, 1997.
  36. The random walk metropolis: linking theory and practice through a case study. Statistical Science, 25(2):172–190, 2010.
  37. Luke Tierney. Markov chains for exploring posterior distributions. The Annals of Statistics, 22(4):1701–1728, 1994.
  38. A note on the polynomial ergodicity of the one-dimensional zig-zag process. Journal of Applied Probability, 59(3):895–903, 2022.
  39. Speed up zig-zag. The Annals of Applied Probability, 33(6A):4693–4746, 2023.
  40. Complexity results for mcmc derived from quantitative bounds. The Annals of Applied Probability, 33(2):1459–1500, 2023.
  41. Optimal scaling of random-walk Metropolis algorithms on general target distributions. Stochastic Processes and their Applications, 130(10):6094–6132, 2020.
  42. Monte carlo on manifolds: sampling densities and integrating functions. Communications on Pure and Applied Mathematics, 71(12):2609–2647, 2018.
Citations (12)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets