Poster
AutoStep: Locally adaptive involutive MCMC
Tiange Liu · Nikola Surjanovic · Miguel Biron-Lattes · Alexandre Bouchard-Côté · Trevor Campbell
East Exhibition Hall A-B #E-1306
Markov Chain Monte Carlo (MCMC) methods are powerful tools used to sample from complex probability distributions. A key challenge in using these methods is choosing the right “step size,” which controls how far the algorithm moves at each step. If the step size is too small, the algorithm moves slowly; if it is too large, the algorithm frequently gets rejected. In many real-world problems, there is no single step size that works well everywhere.Our work introduces AutoStep MCMC, a method that automatically selects a “good” step size at each iteration based on the local shape of the target distribution. This makes the algorithm more reliable, especially for challenging models that vary widely across different regions. We prove that our method explores properly and does not get stuck, and we show it performs competitively with the best existing samplers on a range of problems.By making MCMC more adaptive and easier to use, AutoStep helps researchers get better results with less manual tuning, opening the door to more robust and automated statistical inference.