Score: 1

Sub-Cauchy Sampling: Escaping the Dark Side of the Moon

Published: January 16, 2026 | arXiv ID: 2601.11066v1

By: Sebastiano Grazzi , Sifan Liu , Gareth O. Roberts and more

Potential Business Impact:

Helps computers solve hard math problems better.

Business Areas:
A/B Testing Data and Analytics

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.

Repos / Data Links

Page Count
26 pages

Category
Statistics:
Computation