Pith. sign in

REVIEW 1 cited by

Stein Variational Gradient Descent With Matrix-Valued Kernels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.12794 v2 pith:VRLJ4QRK submitted 2019-10-28 stat.ML cs.LG

Stein Variational Gradient Descent With Matrix-Valued Kernels

classification stat.ML cs.LG
keywords svgdgradientinferenceinformationkernelsdescentincorporatematrices
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Stein variational gradient descent (SVGD) is a particle-based inference algorithm that leverages gradient information for efficient approximate inference. In this work, we enhance SVGD by leveraging preconditioning matrices, such as the Hessian and Fisher information matrix, to incorporate geometric information into SVGD updates. We achieve this by presenting a generalization of SVGD that replaces the scalar-valued kernels in vanilla SVGD with more general matrix-valued kernels. This yields a significant extension of SVGD, and more importantly, allows us to flexibly incorporate various preconditioning matrices to accelerate the exploration in the probability landscape. Empirical results show that our method outperforms vanilla SVGD and a variety of baseline approaches over a range of real-world Bayesian inference tasks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient Bayesian Sampling with Langevin Birth-Death Dynamics

    stat.AP 2025-09 conditional novelty 5.0

    An ensemble Langevin sampler with birth-death jumps and topology-aware reparameterization recovers GW150914 parameters faster than nested sampling but systematically overconstrains them.