atlas

Research map / Optimization / Optimizers

A Non-Asymptotic Analysis for Stein Variational Gradient Descent

NeurIPS 2020 · Optimization › Optimizers · approach: Stein variational gradient descent · 28 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Apply discrete-time SVGD with a sufficiently small step size under the stated boundedness and smoothness assumptionsSVGD · Population regimeKL divergence: KL(μ_{n+1}|π)-KL(μ_n|π)≤ -γ (1- γ ((α² + M)B²)/2) I_stein(μ_n|π)Helped
Use discrete-time SVGD with the stated step-size assumptionsSVGD · Population regimeAverage Stein Fisher Information: 1/n ∑_{k=1}^n I_Stein(μ_k|π)≤ KL(μ_0|π)/(c_γ n)Helped
Use N interacting particles to approximate population SVGDFinite-particle SVGD · Finite-particle approximationExpected squared W₂ distance to population distribution: E[W₂²(μ_n,μ̂_n)]≤ 1/2(1/√N √var(μ_0)e^{LT})(e^{2LT}-1)Helped
Assume the Stein log-Sobolev inequalitySVGD gradient flow · Continuous-time population regimeKL divergence: KL(μ_t|π)≤ e^{-2λt}KL(μ_0|π)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy