stat.MLOct 26, 2026

Anchored Stein Variational Gradient Descent Algorithm for Non-smooth Sampling

Authors: Thanh Dang, Matthew X. Burns, Jiaming Liang

Organizations: Department of Computer Science, University of Rochester, Rochester, NY 14620. · Department of Electrical and Computer Engineering, University of Rochester, Rochester, NY 14627 · Goergen Institute for Data Science and Artificial Intelligence and Department of Computer Science, University of Rochester, Rochester, NY 14620

Abstract

We introduce a Stein variational framework for sampling from a target density p∝e−Up\propto e^{-U} when the target potential UU is possibly non-smooth. The key idea is to introduce a smoother reference potential U0U_0 and the anchor weight a=eU−U0a=e^{U-U_0}. The resulting anchored Stein variational gradient descent (SVGD) algorithm is able to target p∝e−Up\propto e^{-U} without computing the gradient of UU and include standard SVGD as a special case. In particular, we allow the target potential UU to be locally Lipschitz while the reference potential U0U_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 U0U_0 based on UU.

Figures & tables

Explore similar work

CardsList
  1. Accelerating Non-Smooth and Heavy-Tailed Sampling

    Oct 8, 2026Pervez Ali, Xiaoyu Wang, Yingli Wang +1Constrained SamplingLangevin Dynamics

  2. Improved Finite-Particle Convergence Rates for Stein Variational Gradient Descent

    Sep 13, 2024Sayan Banerjee, Krishnakumar Balasubramanian, Promit GhosalKernel MethodsVariational Inference