Skip to content

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

Jul 2026 · arXiv.org · Vol abs/2607.28413 · 2 citations · 35 references
Computer Science Mathematics

Abstract

Let $\mu(d x)\propto e^{-U(x)} d x$ on $\R^d$, where $U$ is $m$-strongly convex and $L$-smooth, and denote by $\kappa=L/m$ the condition number. We consider windowed thinning, an exact simulation method for the bouncy particle sampler and the coordinate Zigzag process. The method divides a trajectory into deterministic windows and uses a gradient evaluation at the beginning of each window to construct a tractable local envelope for the event rate. Combining this construction with quantitative mixing estimates and finite-time bounds on the expected numbers of bounces and flips yields query complexity guarantees from a Gaussian cold start. For total-variation error $\varepsilon$, the expected query counts are $O(\kappa^{1/2}d\,(d\log\kappa+\log\frac1\varepsilon))$ gradient queries for the bouncy particle sampler and $O(\kappa d^{1/4}(d\log\kappa+\log\frac1\varepsilon))$ full-gradient equivalents for Zigzag, where $d$ coordinate-partial queries count as one equivalent.

View source

Similar papers

#machine learning Preprint Sep 2026

Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler

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.

Fan Chen, Sinho Chewi, Jian-Feng Lu et al. · 0 citations
Preprint Sep 2026

A spectral gap for Metropolis-adjusted Langevin algorithm with a uniformly randomized step size

Let $\pi(\mathrm{d} x)\propto e^{-U(x)}\, \mathrm{d} x$ on $\mathbb{R}^d$, where $U$ is continuously differentiable and $m$-strongly convex with a globally $L$-Lipschitz gradient, $0<m\leq L<\infty$, and $\kappa=L/m$. Fixed-step Metropolis-adjusted Langevin algorithm (MALA) has known warm-start mixing-time upper bounds...

Qian Qin · 0 citations
Preprint Aug 2026

Hit-and-Run Mixes as Fast as the Ball Walk

Let $K\subset\mathbb{R}^n$ be an isotropic convex body. We prove that the hit-and-run walk, started from any $M$-warm distribution, reaches total-variation distance $\varepsilon$ from the uniform distribution on $K$ in $O\!\left(n^2\psi_n^{-2}\log^3(M/\varepsilon)\right)$ steps, where $\psi_n^{-1}$ is the Kannan-Lov\'a...

Ruizhe Zhang · 0 citations
Preprint Sep 2026

High-accuracy simulation of Picard HMC, part I: Gaussian cloud correction

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
Preprint Aug 2026

Fixed-particle-number optimizers for the Lieb--Oxford inequality

Let $\mathsf{d}\geq1$, $0<\mathsf{s}<\mathsf{d}$, and $N\geq1$. We prove that the optimal fixed-particle-number constant $\Lambda_N(\mathsf{s},\mathsf{d})$ in the Riesz Lieb--Oxford inequality is attained and that these constants are strictly increasing in $N$. The proof combines grand-canonical concentration--compactn...

Matthew Rosenzweig · 0 citations
Sep 2026

Sampling Matchings in Near-linear Time

For every fixed activity $\lambda>0$, we establish three results for the monomer--dimer model on an $n$-vertex simple graph $G$ with $m\ge1$ edges and maximum degree $\Delta$. 1. Near-linear mixing and sampling. Single-edge Glauber dynamics has mixing time $O_\lambda(m[\log^2 n+\log(1/\varepsilon)])$, giving a near-lin...

Tian-Shun Miao, Yi-Tong Yin · 1 citation

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.