arxiv
PublishedJuly 31, 2026 at 4:00 AM
—neutral
Windowed thinning and query complexity for the bouncy particle and Zigzag samplers
Publisher summary· verbatim
arXiv:2607.28413v1 Announce Type: cross 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 coordin
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivWhen Generated Information Returns: Error Persistence in LLM-Mediated Information Ecosystems13harxivQuery-Driven Learning for Lifted Reasoning13harxivThe Social World Model Evaluation Gap13harxivConviction Without Evidence: Verdict Stability Is Independent of Visual Grounding in Medical Vision--Language Models13hThe Bubble Brief
MON · WED · FRIRead simulation insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗