Sub-Cauchy Sampling: Escaping the Dark Side of the Moon
By: Sebastiano Grazzi , Sifan Liu , Gareth O. Roberts and more
Potential Business Impact:
Helps computers solve hard math problems better.
We introduce a Markov chain Monte Carlo algorithm based on Sub-Cauchy Projection, a geometric transformation that generalizes stereographic projection by mapping Euclidean space into a spherical cap of a hyper-sphere, referred to as the complement of the dark side of the moon. We prove that our proposed method is uniformly ergodic for sub-Cauchy targets, namely targets whose tails are at most as heavy as a multidimensional Cauchy distribution, and show empirically its performance for challenging high-dimensional problems. The simplicity and broad applicability of our approach open new opportunities for Bayesian modeling and computation with heavy-tailed distributions in settings where most existing methods are unreliable.
Similar Papers
Stereographic Multi-Try Metropolis Algorithms for Heavy-tailed Sampling
Computation
Finds patterns faster in tricky data.
Self-supervised diffusion model fine-tuning for costate initialization using Markov chain Monte Carlo
Earth and Planetary Astrophysics
Finds best paths for spaceships to fly.
Gradient-Informed Monte Carlo Fine-Tuning of Diffusion Models for Low-Thrust Trajectory Design
Systems and Control
Finds best spaceship paths to planets faster.