mlsanityData to 14 Oct 2026

The Within-Orbit Adaptive Leapfrog No-U-Turn Sampler

arXiv 2506.18746 ↗First posted 23 Jun 2025stat.CO math.PR stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Locally adapting parameters within Markov chain Monte Carlo methods while preserving reversibility is notoriously difficult. The success of the No-U-Turn Sampler (NUTS) largely stems from its clever local adaptation of the integration time in Hamiltonian Monte Carlo via a geometric U-turn condition. However, posterior distributions frequently exhibit multi-scale geometries with extreme variations in scale, making it necessary to also adapt the leapfrog integrator's step size locally and dynamically. Despite its practical importance, this problem has remained largely open since the introduction of NUTS by Hoffman and Gelman (2014). To address this issue, we introduce the Within-orbit Adaptive Leapfrog No-U-Turn Sampler (WALNUTS), a generalization of NUTS that adapts the leapfrog step size at fixed intervals of simulated time as the orbit evolves. At each interval, the algorithm selects the largest step size from a dyadic schedule that keeps the energy error below a user-specified threshold. Like NUTS, WALNUTS employs biased progressive state selection to favor states with positions that are further from the initial point along the orbit. Empirical evaluations on multiscale target distributions, including Neal's funnel and the Stock-Watson stochastic volatility time-series model, demonstrate that WALNUTS achieves substantial improvements in sampling efficiency and robustness compared to standard NUTS.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 49 references that are in the map. First posted on arXiv 23 Jun 2025.

Builds on

22 of 49 references.

References · 22

  1. 2017A Conceptual Introduction to Hamiltonian Monte Carlocited by 209
  2. 2013Hamiltonian Monte Carlo for Hierarchical Modelscited by 52
  3. 2017Geometric integrators and the Hamiltonian Monte Carlo methodcited by 25
  4. 2023The Shrinkage-Delinkage Trade-off: An Analysis of Factorized Gaussian Approximations for Variational Inferencecited by 10
  5. 2020A general perspective on the Metropolis-Hastings kernelcited by 9
  6. 2024GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlocited by 9
  7. 2024Variational Inference in Location-Scale Families: Exact Recovery of the Mean and Correlation Matrixcited by 9
  8. 2020Connecting the Dots: Numerical Randomized Hamiltonian Monte Carlo with State-Dependent Event Ratescited by 8
  9. 2021Delayed rejection Hamiltonian Monte Carlo for sampling multiscale distributionscited by 7
  10. 2024Incorporating Local Step-Size Adaptivity into the No-U-Turn Sampler using Gibbs Self Tuningcited by 7
  11. 2021Couplings for Multinomial Hamiltonian Monte Carlocited by 5
  12. 2021The Apogee to Apogee Path Samplercited by 5
10 more
  1. 2024Mixing of the No-U-Turn Sampler and the Geometry of Gaussian Concentrationcited by 5
  2. 2015Adaptive step size selection for Hessian-based manifold Langevin samplerscited by 4
  3. 2024Tuning diagonal scale matrices for HMCcited by 4
  4. 2024AutoStep: Locally adaptive involutive MCMCcited by 4
  5. 2025New affine invariant ensemble samplers and their dimensional scalingcited by 4
  6. 2018Dynamically rescaled Hamiltonian Monte Carlo for Bayesian Hierarchical Modelscited by 3
  7. 2022Randomized Time Riemannian Manifold Hamiltonian Monte Carlocited by 3
  8. 2020On the accept-reject mechanism for Metropolis-Hastings algorithmscited by 2
  9. 2025Towards practical PDMP sampling: Metropolis adjustments, locally adaptive step-sizes, and NUTS-based time lengthscited by 2
  10. 2025Hamiltonian Descent Algorithms for Optimization: Accelerated Rates via Randomized Integration Timecited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.