Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 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

Convergence of hybrid slice sampling via spectral gap (1409.2709v2)

Published 9 Sep 2014 in stat.ME

Abstract: It is known that the simple slice sampler has robust convergence properties, however the class of problems where it can be implemented is limited. In contrast, we consider hybrid slice samplers which are easily implementable and where another Markov chain approximately samples the uniform distribution on each slice. Under appropriate assumptions on the Markov chain on the slice we show a lower bound and an upper bound of the spectral gap of the hybrid slice sampler in terms of the spectral gap of the simple slice sampler. An immediate consequence of this is that spectral gap and geometric ergodicity of the hybrid slice sampler can be concluded from spectral gap and geometric ergodicity of its simple version which is very well understood. These results indicate that robustness properties of the simple slice sampler are inherited by (appropriately designed) easily implementable hybrid versions. We apply the developed theory and analyse a number of specific algorithms such as the stepping-out shrinkage slice sampling, hit-and-run slice sampling on a class of multivariate targets and an easily implementable combination of both procedures on multidimensional bimodal densities.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. Baxendale, P. (2005). Renewal theory and computable convergence rates for geometrically ergodic Markov chains. Ann. Appl. Probab. 15, 700–738.
  2. A few remarks on Fixed-width output analysis for Markov chain Monte Carlo by Jones et al. J. Amer. Statist. Assoc. 102, 1485–1486.
  3. Hit-and-run algorithms for generating multivariate distributions. Math. Oper. Res. 18, 255–266.
  4. Spatial statistics and Bayesian computation. J. Roy. Statist. Soc. Ser. B 25–37.
  5. On the hit and run process. Tech. rep. 497, Dep. Stat., University of California, Berkeley 1–16.
  6. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Phys. Rev. D 38, 2009.
  7. Batch means and spectral variance estimators in Markov chain Monte Carlo. Ann. Statist. 38, 1034–1070.
  8. Geyer, C. (1992). Practical Markov chain Monte Carlo. Statist. Sci. 7, 473–483.
  9. Higdon, D. (1998). Auxiliary variable methods for Markov chain Monte Carlo with applications. J. Amer. Statist. Assoc. 93, 585–595.
  10. On the applicability of regenerative simulation in Markov chain Monte Carlo. Biometrika 89, 731.
  11. Fixed-width output analysis for Markov chain Monte Carlo. J. Amer. Statist. Assoc. 101, 1537–1547.
  12. Direction choice for accelerated convergence in hit-and-run sampling. Oper. Res. 46, 84–95.
  13. An analysis of a variation of hit-and-run for uniform sampling from general regions. ACM Trans. Model. Comput. Simul. 21, 16:1–16:11.
  14. Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions. Comm. Math. Phys. 104, 1–19.
  15. Geometric ergodicity and the spectral gap of non-reversible Markov chains. Probab. Theory Related Fields 154, 327–339.
  16. Lovász, L. (1999). Hit-and-run mixes fast. Math. Program. 86, 443–461.
  17. Hit-and-run from a corner. SIAM J. Comput. 35, 985–1005.
  18. Markov chains and stochastic stability second ed. Cambridge University Press.
  19. Mira, A. (2001). Ordering and improving the performance of Monte Carlo Markov chains. Statist. Sci. 16, 340–350.
  20. Perfect slice samplers. J. Roy. Statist. Soc. Ser. B 63, 593–606.
  21. Efficiency and convergence properties of slice samplers. Scand. J. Statist. 29, 1–12.
  22. Elliptical slice sampling. In The Proceedings of the 13th International Conference on Artificial Intelligence and Statistics. vol. 9 of JMLR: W&CP. pp. 541–548.
  23. Geometric convergence of elliptical slice sampling. In Proceedings of the 38th International Conference on Machine Learning. vol. 139 of PMLR. pp. 7969–7978.
  24. Quantitative spectral gap estimate and Wasserstein contraction of simple slice sampling. Ann. Appl. Probab. 31, 806 – 825.
  25. Neal, R. (1993). Probabilistic inference using Markov chain Monte Carlo methods. Department of Computer Science, University of Toronto, ON, Canada.
  26. Neal, R. (2003). Slice sampling. Ann. Statist. 31, 705–767. With discussions and a rejoinder by the author.
  27. Computation of expectations by Markov chain Monte Carlo methods. Extraction of Quantifiable Information from Complex Systems 397–411.
  28. Geometric ergodicity and hybrid Markov chains. Electron. Comm. Probab. 2, no. 2, 13–25.
  29. Convergence of slice sampler Markov chains. J. R. Stat. Soc. Ser. B Stat. Methodol. 61, 643–660.
  30. The polar slice sampler. Stoch. Models 18, 257–280.
  31. Variance bounding Markov chains. Ann. Appl. Probab. 18, 1201–1214.
  32. Rudin, W. (1991). Functional analysis second ed. International Series in Pure and Applied Mathematics. McGraw-Hill Inc., New York.
  33. Rudolf, D. (2012). Explicit error bounds for Markov chain Monte Carlo. Dissertationes Math. 485, 93 pp.
  34. Rudolf, D. (2013). Hit-and-run for numerical integration. J. Dick, F. Kuo, G. Peters, and I. Sloan (Eds.) - Monte Carlo and Quasi-Monte Carlo Methods 2012. Springer, Berlin 565–579.
  35. Positivity of hit-and-run and related algorithms. Electron. Commun. Probab. 18, 1–8.
  36. Comparison of hit-and-run, slice sampler and random walk Metropolis. J. Appl. Probab. 55, 1186–1202.
  37. Gibbsian polar slice sampling. In Proceedings of the 40th International Conference on Machine Learning. vol. 202. PMLR. pp. 30204–30223.
  38. Smith, R. (1984). Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32, 1296–1308.
  39. Ullrich, M. (2012). Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions. ArXiv e-prints.
  40. Ullrich, M. (2014). Rapid mixing of Swendsen-Wang dynamics in two dimensions. Dissertationes Math. 502, 64 pp.
  41. Nonuniversal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett..
  42. Werner, D. (2005). Funktionalanalysis. Springer Verlag.
Citations (11)

Summary

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