paper-with-me

Papers

Binary Bouncy Particle Sampler

2017-11-02 · Ari Pakman

The Bouncy Particle Sampler is a novel rejection-free non-reversible sampler for differentiable probability distributions over continuous variables. We generalize the algorithm to piecewise differentiable distributions and apply it to generic binary distributions using a piecewise differentiable augmentation. We illustrate the new algorithm in a binary Markov Random Field example, and compare it to binary Hamiltonian Monte Carlo. Our results suggest that binary BPS samplers are better for easy to mix distributions.

📄 PDF Abstract BibTeX arXiv:1711.00922

Code (1)

aripakman/binary_bps 공식 구현

Similar Papers 제목 키워드 기반

Windowed thinning and query complexity for the bouncy particle and Zigzag samplers

2026-07-30 · Jianfeng Lu, Yinchen Luo arxiv

Let $μ(d x)\propto e^{-U(x)} d x$ on $\R^d$, where $U$ is $m$-strongly convex and $L$-smooth, and denote by $κ=L/m$ the condition number. We consider windowed thinning, an exact simulation method for the bouncy particle …

Stochastic Bouncy Particle Sampler

2016-09-03 · ICML 2017 8 · Ari Pakman, Dar Gilboa, David Carlson, Liam Paninski

We introduce a novel stochastic version of the non-reversible, rejection-free Bouncy Particle Sampler (BPS), a Markov process whose sample trajectories are piecewise linear. The algorithm is based on simulating first arr…

Piecewise Deterministic Markov Processes for Bayesian Inference of PDE Coefficients

2026-02-05 · Leon Riccius, Iuri B. C. M. Rocha, Joris Bierkens, Hanne Kekkonen 외 arxiv

We develop a general framework for piecewise deterministic Markov process (PDMP) samplers that enables efficient Bayesian inference in non-linear inverse problems with expensive likelihoods. The key ingredient is a surro…

Bayesian Inference

Analysis of high-dimensional Continuous Time Markov Chains using the Local Bouncy Particle Sampler

2019-05-30 · Tingting Zhao, Alexandre Bouchard-Côté

Sampling the parameters of high-dimensional Continuous Time Markov Chains (CTMC) is a challenging problem with important applications in many fields of applied statistics. In this work a recently proposed type of non-rev…

Computational Efficiency

Markov chain Monte Carlo algorithms with sequential proposals

2019-07-15 · Joonha Park, Yves F. Atchadé

We explore a general framework in Markov chain Monte Carlo (MCMC) sampling where sequential proposals are tried as a candidate for the next state of the Markov chain. This sequential-proposal framework can be applied to …