Stein's method meets computational statistics: A review of some recent developments
Stein's method compares probability distributions through the study of a class of linear
operators called Stein operators. While mainly studied in probability and used to underpin …
operators called Stein operators. While mainly studied in probability and used to underpin …
On the geometry of Stein variational gradient descent
Bayesian inference problems require sampling or approximating high-dimensional
probability distributions. The focus of this paper is on the recently introduced Stein …
probability distributions. The focus of this paper is on the recently introduced Stein …
Convergence of Stein variational gradient descent under a weaker smoothness condition
Abstract Stein Variational Gradient Descent (SVGD) is an important alternative to the
Langevin-type algorithms for sampling from probability distributions of the form $\pi …
Langevin-type algorithms for sampling from probability distributions of the form $\pi …
Provably fast finite particle variants of svgd via virtual particle stochastic approximation
Abstract Stein Variational Gradient Descent (SVGD) is a popular particle-based variational
inference algorithm with impressive empirical performance across various domains …
inference algorithm with impressive empirical performance across various domains …
A convergence theory for SVGD in the population limit under Talagrand's inequality T1
Abstract Stein Variational Gradient Descent (SVGD) is an algorithm for sampling from a
target density which is known up to a multiplicative constant. Although SVGD is a popular …
target density which is known up to a multiplicative constant. Although SVGD is a popular …
Wasserstein steepest descent flows of discrepancies with Riesz kernels
The aim of this paper is twofold. Based on the geometric Wasserstein tangent space, we first
introduce Wasserstein steepest descent flows. These are locally absolutely continuous …
introduce Wasserstein steepest descent flows. These are locally absolutely continuous …
Covariance-modulated optimal transport and gradient flows
We study a variant of the dynamical optimal transport problem in which the energy to be
minimised is modulated by the covariance matrix of the distribution. Such transport metrics …
minimised is modulated by the covariance matrix of the distribution. Such transport metrics …
On the geometry of Stein variational gradient descent
Bayesian inference problems require sampling or approximating high-dimensional
probability dis-tributions. The focus of this paper is on the recently introduced Stein …
probability dis-tributions. The focus of this paper is on the recently introduced Stein …
Rough McKean–Vlasov dynamics for robust ensemble Kalman filtering
Motivated by the challenge of incorporating data into misspecified and multiscale dynamical
models, we study a McKean–Vlasov equation that contains the data stream as a common …
models, we study a McKean–Vlasov equation that contains the data stream as a common …
GAD-PVI: A General Accelerated Dynamic-Weight Particle-Based Variational Inference Framework
Particle-based Variational Inference (ParVI) methods approximate the target distribution by
iteratively evolving finite weighted particle systems. Recent advances of ParVI methods …
iteratively evolving finite weighted particle systems. Recent advances of ParVI methods …