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
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivPlanning and Scheduling Business Processes under Control-Flow Uncertainty11harxivDiffs vs. Whole Files: An Empirical Comparison of Iterative Edit-Based and Direct Generation for Flutter/Dart Code Models11harxivSIM: Subspace Interaction-based Method for Token-Level Text Anomaly Detection11harxivWAPP: Safe Learning of Positive Security WAF Policies from Live Traffic11hThe Bubble Brief
WEEKLYRead simulation insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗