Geodesic Slice Sampler for Multimodal Distributions with Strong Curvature
Not on the map. Why?
Abstract (arXiv)
Traditional Markov Chain Monte Carlo sampling methods often struggle with sharp curvatures, intricate geometries, and multimodal distributions. Slice sampling can resolve local exploration inefficiency issues, and Riemannian geometries help with sharp curvatures. Recent extensions enable slice sampling on Riemannian manifolds, but they are restricted to cases where geodesics are available in a closed form. We propose a method that generalizes Hit-and-Run slice sampling to more general geometries tailored to the target distribution, by approximating geodesics as solutions to differential equations. Our approach enables the exploration of the regions with strong curvature and rapid transitions between modes in multimodal distributions. We demonstrate the advantages of the approach over challenging sampling problems.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 39 references that are in the map. First posted on arXiv 28 Feb 2025.
Builds on
12 of 39 references.
References · 12
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
- 2022On Neural Differential Equationscited by 268
- 2016A Kernelized Stein Discrepancy for Goodness-of-fit Tests and Model Evaluationcited by 236
- 2024BlackJAX: Composable Bayesian inference in JAXcited by 26
- 2024Diffusive Gibbs Samplingcited by 21
- 2022Lagrangian Manifold Monte Carlo on Monge Patchescited by 11
- 2024Markovian Flow Matching: Accelerating MCMC with Continuous Normalizing Flowscited by 9
- 2023Riemannian Laplace Approximation with the Fisher Metriccited by 7
- 2014Convergence of hybrid slice sampling via spectral gapcited by 4
- 2023Geodesic slice sampling on the spherecited by 4
- 2023Warped geometric information on the optimisation of Euclidean functionscited by 3
Built on by
Citing papers per year: 2026: 2.
2 papers.