Parallel Affine Transformation Tuning of Markov Chain Monte Carlo
Philip Schär, Michael Habeck, Daniel Rudolf
Abstract
The performance of Markov chain Monte Carlo samplers strongly depends on the properties of the target distribution such as its covariance structure, the location of its probability mass and its tail behavior. We explore the use of bijective affine transformations of the sample space to improve the properties of the target distribution and thereby the performance of samplers running in the transformed space. In particular, we propose a flexible and user-friendly scheme for adaptively learning the affine transformation during sampling. Moreover, the combination of our scheme with Gibbsian polar slice sampling is shown to produce samples of high quality at comparatively low computational cost in several settings based on real-world data.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on2
Related papers
- Geometric convergence of elliptical slice samplingViacheslav Natarovskii, Daniel Rudolf, Björn SprungkICML 2021 · 14 citations
- Automatic Data Augmentation via Invariance-Constrained LearningIgnacio Hounie, Luiz F. O. Chamon, Alejandro RibeiroICML 2023 · 20 citations
- Parallel tempering on optimized pathsSaifuddin Syed, Vittorio Romaniello, Trevor Campbell, Alexandre Bouchard-CôtéICML 2021 · 28 citations
- AutoStep: Locally adaptive involutive MCMCTiange Liu, Nikola Surjanovic, Miguel Biron-Lattes, Alexandre Bouchard-Côté et al.ICML 2025
- Entropic Mirror Monte CarloAnas CHERRADI, Yazid Janati, Alain Oliviero Durmus, Sylvain Le Corff et al.ICML 2026
