Table of Contents
Fetching ...

Regularized Stein Variational Gradient Flow

Ye He, Krishnakumar Balasubramanian, Bharath K. Sriperumbudur, Jianfeng Lu

TL;DR

This work tackles the mismatch between deterministic Stein variational gradient flows and the true Wasserstein gradient flow by introducing Regularized SVGF (R-SVGF), which injects a regularization via $\left((1-\nu)\mathcal{T}_{k,\rho}+\nu I\right)^{-1}$ to interpolate between the Stein and Wasserstein dynamics. The authors develop a mean-field PDE for $\rho_t$, establish the existence and uniqueness of weak solutions, and prove stability and convergence results in Fisher information and KL divergence, including under a log-Sobolev inequality. They also analyze a time-discretized version and present a practical Regularized SVGD algorithm with a concrete particle-update scheme and computational considerations, complemented by synthetic numerical evidence of improved performance. The framework provides a principled path to closely approximate the WGF while retaining a controllable, implementable discretization, with explicit rates and dependencies on the regularization parameter $\nu$, kernel spectral data, and functional inequalities.

Abstract

The Stein Variational Gradient Descent (SVGD) algorithm is a deterministic particle method for sampling. However, a mean-field analysis reveals that the gradient flow corresponding to the SVGD algorithm (i.e., the Stein Variational Gradient Flow) only provides a constant-order approximation to the Wasserstein Gradient Flow corresponding to the KL-divergence minimization. In this work, we propose the Regularized Stein Variational Gradient Flow, which interpolates between the Stein Variational Gradient Flow and the Wasserstein Gradient Flow. We establish various theoretical properties of the Regularized Stein Variational Gradient Flow (and its time-discretization) including convergence to equilibrium, existence and uniqueness of weak solutions, and stability of the solutions. We provide preliminary numerical evidence of the improved performance offered by the regularization.

Regularized Stein Variational Gradient Flow

TL;DR

This work tackles the mismatch between deterministic Stein variational gradient flows and the true Wasserstein gradient flow by introducing Regularized SVGF (R-SVGF), which injects a regularization via to interpolate between the Stein and Wasserstein dynamics. The authors develop a mean-field PDE for , establish the existence and uniqueness of weak solutions, and prove stability and convergence results in Fisher information and KL divergence, including under a log-Sobolev inequality. They also analyze a time-discretized version and present a practical Regularized SVGD algorithm with a concrete particle-update scheme and computational considerations, complemented by synthetic numerical evidence of improved performance. The framework provides a principled path to closely approximate the WGF while retaining a controllable, implementable discretization, with explicit rates and dependencies on the regularization parameter , kernel spectral data, and functional inequalities.

Abstract

The Stein Variational Gradient Descent (SVGD) algorithm is a deterministic particle method for sampling. However, a mean-field analysis reveals that the gradient flow corresponding to the SVGD algorithm (i.e., the Stein Variational Gradient Flow) only provides a constant-order approximation to the Wasserstein Gradient Flow corresponding to the KL-divergence minimization. In this work, we propose the Regularized Stein Variational Gradient Flow, which interpolates between the Stein Variational Gradient Flow and the Wasserstein Gradient Flow. We establish various theoretical properties of the Regularized Stein Variational Gradient Flow (and its time-discretization) including convergence to equilibrium, existence and uniqueness of weak solutions, and stability of the solutions. We provide preliminary numerical evidence of the improved performance offered by the regularization.
Paper Structure (16 sections, 18 theorems, 189 equations, 1 figure, 2 tables)

This paper contains 16 sections, 18 theorems, 189 equations, 1 figure, 2 tables.

Key Result

Proposition 1

The following holds.

Figures (1)

  • Figure 1: R-SVGD for various values of the regularization parameter $\nu$. The case of $\nu=1$ corresponds to SVGD. Left, Middle and Right columns correspond respectively to $h_1(x):= x$, $h_2(x):= x^2$ and $h_3(x):= \cos (\omega x +b)$. Top and bottom rows correspond respectively to log(MSE) versus number of particles and number of iterations.

Theorems & Definitions (47)

  • Proposition 1: steinwart2008support
  • Remark 1
  • Proposition 2
  • proof
  • Remark 2
  • Definition 1: Regularized Stein-Fisher Information
  • Remark 3
  • Proposition 3: Equivalence relation between $I(\rho|\pi)$ and $I_{\nu,Stein}(\rho|\pi)$
  • proof : Proof of Proposition \ref{['lem:relation between I and regularized Istein']}
  • Theorem 1: Relation to the WGF in Relative Fisher Information
  • ...and 37 more