Smoothing Out Sticking Points: Sampling from Discrete-Continuous Mixtures with Dynamical Monte Carlo by Mapping Discrete Mass into a Latent Universe

Combining a continuous"slab"density with discrete"spike"mass at zero, spike-and-slab priors provide important tools for inducing sparsity and carrying out variable selection in Bayesian models. However, the presence of discrete mass makes posterior inference challenging."Sticky"extensions to piecewise-deterministic Markov process samplers have shown promising performance, where sampling from the spike is achieved by the process sticking there for an exponentially distributed duration. As it turns out, the sampler remains valid when the exponential sticking time is replaced with its expectation. We justify this by mapping the spike to a continuous density over a latent universe, allowing the sampler to be reinterpreted as traversing this universe while being stuck in the original space. This perspective opens up an array of possibilities to carry out posterior computation under spike-and-slab type priors. Notably, it enables us to construct sticky samplers using other dynamics-based paradigms such as Hamiltonian Monte Carlo; in fact, original sticky process can be established as a partial position-momentum refreshment limit of our Hamiltonian sticky sampler. Our theoretical and empirical findings suggest these alternatives to be at least as efficient as the original sticky approach.

• Publication year

  2025

• Venue

  Unknown venue

• Publication date

  2025-11-10

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  arXiv 2511.07340
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• MCMC using $\textit{bouncy}$ Hamiltonian dynamics: A unifying framework for Hamiltonian Monte Carlo and piecewise deterministic Markov process samplers

  2024cited by this paper
• Hamiltonian Monte Carlo on ReLU Neural Networks is Inefficient

  2024cited by this paper
• A Robust Bayesian Method for Building Polygenic Risk Scores using Projected Summary Statistics and Bridge Prior

  2024cited by this paper
• Piecewise deterministic sampling with splitting schemes

  2023cited by this paper
• PyMC: a modern, and comprehensive probabilistic programming framework in Python

  2023cited by this paper
• Zigzag Path Connects Two Monte Carlo Samplers: Hamiltonian Counterpart to a Piecewise Deterministic Markov Process

  2021cited by this paper
• Rao-Blackwellization in the MCMC era

  2021cited by this paper
• Sticky PDMP samplers for sparse and local inference problems

  2021cited by this paper
• PDMP Monte Carlo methods for piecewise smooth densities

  2021cited by this paper
• Reversible Jump PDMP Samplers for Variable Selection

  2020cited by this paper
• Discontinuous Hamiltonian Monte Carlo for discrete parameters and discontinuous likelihoods

  2020cited by this paper
• Kinetic energy choice in Hamiltonian/hybrid Monte Carlo

  2017cited by this paper
• Ergodicity of the zigzag process

  2017cited by this paper
• Piecewise Deterministic Markov Processes for Continuous-Time Monte Carlo

  2016cited by this paper
• The Zig-Zag process and super-efficient sampling for Bayesian analysis of big data

  2016cited by this paper
• The Bouncy Particle Sampler: A Nonreversible Rejection-Free Markov Chain Monte Carlo Method

  2015cited by this paper
• Decoupling Shrinkage and Selection in Bayesian Linear Models: A Posterior Summary Perspective

  2014cited by this paper
• Auxiliary-variable Exact Hamiltonian Monte Carlo Samplers for Binary Distributions

  2013cited by this paper
• Bayesian Model Selection in High-Dimensional Settings

  2012cited by this paper
• The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo

  2011cited by this paper
• A review of Bayesian variable selection methods: what, how and which

  2009cited by this paper
• Handling Sparsity via the Horseshoe

  2009cited by this paper
• Reversible jump MCMC

  2009cited by this paper
• A geometric approach to transdimensional markov chain monte carlo

  2003cited by this paper
• Variable selection via Gibbs sampling

  1993cited by this paper
• Bayesian Variable Selection in Linear Regression

  1988cited by this paper
• CONVERGENCE OF PROBABILITY MEASURES

  1970cited by this paper

• No citing papers are available for this paper.