arXiv (All)
open access
Entropy hypocoercivity and query complexity for the bouncy particle sampler
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 th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distribution-uniform strong laws of large numbers#1063704
- (Sharp arithmetic) localization beyond transversality#1342017
- Local laws and spectral properties of deformed sparse random matrices#179199
- Bregman geometry-aware split Gibbs sampling for Bayesian Poisson inverse problems#1115491
- Information Entropy as a Sensitive Diagnostic of Relaxation Dynamics in a Quasiperiodic Mott Insulator#1341672
Record · ID 1400184
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive