Anchored Stein Variational Gradient Descent Algorithm for Non-smooth Sampling
stat.ML, cs.LG
Submitted: 2026-10-26
Updated: 2026-10-26
License: http://creativecommons.org/licenses/by/4.0/
The gist: We introduce a Stein variational framework for sampling from a target density p proportional to e-U when the target potential U is possibly non-smooth.
Abstract
We introduce a Stein variational framework for sampling from a target density p proportional to e-U when the target potential U is possibly non-smooth. The key idea is to introduce a smoother reference potential U 0 and the anchor weight a=e U-U 0. The resulting anchored Stein variational gradient descent (SVGD) algorithm is able to target p proportional to e-U without computing the gradient of U and include standard SVGD as a special case. In particular, we allow the target potential U to be locally Lipschitz while the reference potential U 0 is continuously differentiable, along with other suitable assumptions. Under this low regularity regime, we establish a Kullback-Leibler first variation formula for anchored perturbations, identify the corresponding steepest descent direction in the reproducing kernel Hilbert space and prove a nonasymptotic convergence bound for the anchored SVGD algorithm in terms of an anchored kernelized Stein discrepancy. Finally, we also provide guidance on constructing a suitable reference potential U 0 based on U.
Related papers
- Behavior of prediction performance metrics with rare events
- Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
- A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
- Scalable Posterior Uncertainty for Flexible Density-Based Clustering
- A Transport Geometry of Benign Overfitting
- Efficient quadratic entropy with distance sketches