English

Stereographic Multiple-Try Metropolis

Computation 2026-05-01 v3 Methodology Machine Learning

Abstract

Multiple-proposal MCMC algorithms have recently gained attention for their potential to improve performance, especially through parallel implementation on modern hardware. We introduce Stereographic Multiple-Try Metropolis (SMTM), a novel family of gradient-free algorithms designed for sampling high-dimensional distributions. By integrating multiple-try Metropolis (MTM) with the stereographic MCMC framework, SMTM overcomes the traditional limitations of MTM, particularly its pathological convergence behavior often observed in high dimensions. For both light-tailed and heavy-tailed targets, SMTM not only outperforms classical MTM and the existing stereographic random-walk Metropolis but also demonstrates strong robustness to tuning. These advantages are supported by high-dimensional scaling analysis and validated through extensive simulation studies.

Keywords

Cite

@article{arxiv.2505.12487,
  title  = {Stereographic Multiple-Try Metropolis},
  author = {Zhihao Wang and Jun Yang},
  journal= {arXiv preprint arXiv:2505.12487},
  year   = {2026}
}

Comments

53 pages, 12 figures

R2 v1 2026-07-01T02:19:59.545Z