48 min
Seminar, Hosted by Simons Institute for the Theory of Computing
Windowed thinning and query complexity for the bouncy particle and Zigzag samplers
Duke University
Recording
Abstract
Windowed thinning exactly simulates bouncy-particle and coordinate Zigzag sampling processes by constructing local event-rate envelopes from gradients. For strongly convex, smooth targets, the talk combines this construction with mixing estimates and event-count bounds to derive query-complexity guarantees from a Gaussian cold start, distinguishing full-gradient and coordinate-query costs.