OpenAlex ·
Entropy hypocoercivity and query complexity for the bouncy particle sampler
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.25354
- Original
- Read it at the publisher
- Topics
Abstract
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 $κ=L/m$. For initial laws with bounded density relative to equilibrium, we show that the relative entropy decays exponentially up to an arbitrary additive error $δ$, with a rate that depends only logarithmically on the density bound and on $δ$. From a Gaussian cold start and with a suitably chosen refreshment rate, the relative entropy falls below $δ$ after time $\widetilde O(\sqrt{d/m})$. Combined with exact simulation by windowed thinning, this gives an expected gradient-query complexity of $\widetilde O(d\sqrtκ)$, improving the $\widetilde O(d^2\sqrtκ)$ bound based on $L^2$ hypocoercivity.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Artificial Intelligence
Dimension-free comparison inequalities between $f$-divergences for Gaussian location mixtures
Hadamard Transforms for Dimension Reduction
Exact probability laws of random inner products: Dirichlet splines, overlaps, uncertainty, and Bargmann invariants
Solving the Ho--Nguyen Conjecture for Gaussian Mixtures: Applications to Mixtures of Experts
A discrete-continuous-time stochastic framework for attention-deficit/hyperactivity disorder-related symptom modeling and pharmacological intervention via methylphenidate
Get the few papers worth your time in Artificial Intelligence every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.