The Proximal Bouncy Particle Sampler is a new sampler that combines ideas from the proximal sampler and the bouncy particle sampler that returns a sample whose law is $\varepsilon$-close to $\mu$ in total variation distance using gradient queries in expectation.
Abstract
We study the problem of sampling from $\mu(\mathrm{d}x)\propto e^{-V(x)}\,\mathrm{d}x$ on $\mathbb{R}^d$, where $V$ is $\alpha$-strongly convex and $\beta$-smooth, and write $\kappa:=\beta/\alpha$. We design and analyze the Proximal Bouncy Particle Sampler (Proximal BPS), a new sampler that combines ideas from the proximal sampler and the bouncy particle sampler. From a warm start initialization with $ O(1) $ R\'enyi divergence w.r.t. $\mu$, Proximal BPS returns a sample whose law is $\varepsilon$-close to $\mu$ in total variation distance using $\widetilde O(\sqrt\kappa\,d^{1/4} \,\mathrm{polylog}(1/\varepsilon))$ gradient queries in expectation.
The Gaussian cloud sampler is introduced and the algorithm uses first-order rejection sampling (FORS) to correct the law of smoothed Picard HMC trajectories and a suite of likelihood correction gadgets which only use samples from this indirect cloud representation are developed.
Fan Chen, Sinho Chewi, Jian-Feng Lu et al.· 1 citation· ⚡1
The proofs exploit cancellation at stationarity and smoothing using techniques from Malliavin calculus, outperforming previous upper bounds based on standard couplings and shows surprisingly that in high dimensions, deterministic discretizations can outperform their random counterparts.
Fan Chen, Sinho Chewi, Jian-Feng Lu et al.· 0 citations
We develop a new low-accuracy sampler, called smoothed Picard Hamiltonian Monte Carlo, which combines Gaussian smoothing, Picard iteration, and higher-order discretization. For a log-concave target $\pi \propto \exp(-V)$ in dimension $d$ satisfying $0 \prec \alpha I \preceq \nabla^2 V \preceq \beta I$, with condition n...
Fan Chen, Sinho Chewi, Jian-Feng Lu et al.· 2 citations
We study sampling from $\pi(x)\propto\mathrm{e}^{-V(x)}$ on $\mathbb{R}^d$, where $V$ is $\alpha$-strongly convex and $\beta$-smooth with condition number $\kappa=\beta/\alpha$. For this problem, the proximal sampler preserves the target exactly and recovers overdamped Langevin dynamics in the small-step limit, but its...
We study convergence in relative entropy of the bouncy particle sampler with Gaussian velocity refreshment, for a target $e^{-U}$ on $\mathbb R^d$ with $U$ $m$-strongly convex and $L$-smooth, and condition number $\kappa=L/m$. For initial laws with bounded density relative to equilibrium, we show that the relative entr...
Consider the $\mathbb Z_2$ synchronization problem \[ \boldsymbol{Y} = \frac{\lambda}{\sqrt n} \theta\theta^{\top} + \boldsymbol{Z}, \] where $\theta$ is uniform on $\{-1,1\}^n$ and $\boldsymbol{Z}$ is an independent Gaussian Wigner matrix with off-diagonal variance one. We give a polynomial-time posterior sampling alg...
Zhang-Song Li· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 6, 2026
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.