An ensemble Langevin sampler with birth-death jumps and topology-aware reparameterization recovers GW150914 parameters faster than nested sampling but systematically overconstrains them.
Stein Variational Gradient Descent With Matrix-Valued Kernels
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
stat.AP 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient Bayesian Sampling with Langevin Birth-Death Dynamics
An ensemble Langevin sampler with birth-death jumps and topology-aware reparameterization recovers GW150914 parameters faster than nested sampling but systematically overconstrains them.