正则化Stein变分梯度下降的有限粒子速率

This paper derives finite-particle convergence rates for the Regularized Stein Variational Gradient Descent (R-SVGD) algorithm, which corrects the constant-order bias of SVGD by applying a resolvent-type preconditioner to the kernelized Wasserstein gradient. For the resulting interacting N-particle system, we establish explicit non-asymptotic bounds for time-averaged (annealed) empirical measures, demonstrating its convergence.