Backend
Kinetic Langevin Splitting Schemes for Constrained Sampling
arXiv stat.ML0 views
arXiv:2603.23397v3 Announce Type: replace-cross Abstract: Constrained sampling, the task of generating samples from a distribution restricted to a convex set, is an important problem in computational statistics. In this paper, we propose new unadjusted sampling algorithms obtained by applying the symmetric BAOAB and ABOBA splittings, of the kinetic Langevin dynamics, to a penalized surrogate of the constrained target. This also includes their stochastic gradient versions. Since the Hessian of the penalized surrogate is discontinuous across the boundary of the constraint set, analyses relying on a Lipschitz Hessian do not apply. We therefore develop an analysis based only on strong convexity and smoothness, proving one-step Wasserstein contraction schemes, non-asymptotic Wasserstein bounds of both schemes and complexity bounds. The resulting complexities for the stochastic gradient versions improve substantially on traditional Euler-type discretizations. Numerical experiments verify our theory, which is tested on a toy problem and Bayesian constrained regression problem. Overall, the splitting schemes demonstrate stability at step sizes several times larger than Euler-type methods, require five to seventeen times fewer gradient evaluations for a given accuracy.
Source:https://arxiv.org/abs/2603.23397PreviousSignature-Kernel Based Evaluation Metrics for Robust Probabilistic and Tail-Event ForecastingNextOptimistic Actor-Critic with Parametric Policies for Linear Markov Decision Processes
Related posts
Your Series B Is Earmarked for North America. Your Single-Region Backend Is Not Ready.
0dev.to TypeScript
Scheduled posts for a static site without a CMS: a queue folder, a cron slot, a build that can say no
0dev.to JavaScript
How I made a background remover that runs entirely in the browser
0dev.to JavaScript
When "AI Boom" Becomes "Cloud API Regret": The Case for Client-Side Compute
0dev.to JavaScript
Pointing the OpenAI Python and Node SDKs at a model with fewer refusals
0dev.to JavaScript
Optimizing Rust Lock-Free MPMC for Latency Reduction
0dev.to Rust