Anchored Stein Variational Gradient Descent Algorithm for Non-smooth Sampling
arXiv:2610.36018
Abstract
We introduce a Stein variational framework for sampling from a target density when the target potential is possibly non-smooth. The key idea is to introduce a smoother reference potential and the anchor weight . The resulting anchored Stein variational gradient descent (SVGD) algorithm is able to target without computing the gradient of and include standard SVGD as a special case. In particular, we allow the target potential to be locally Lipschitz while the reference potential 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 based on .