REVIEW 2 cited by
Stochastic Gradient MCMC with Repulsive Forces
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
read the original abstract
We propose a unifying view of two different Bayesian inference algorithms, Stochastic Gradient Markov Chain Monte Carlo (SG-MCMC) and Stein Variational Gradient Descent (SVGD), leading to improved and efficient novel sampling schemes. We show that SVGD combined with a noise term can be framed as a multiple chain SG-MCMC method. Instead of treating each parallel chain independently from others, our proposed algorithm implements a repulsive force between particles, avoiding collapse and facilitating a better exploration of the parameter space. We also show how the addition of this noise term is necessary to obtain a valid SG-MCMC sampler, a significant difference with SVGD. Experiments with both synthetic distributions and real datasets illustrate the benefits of the proposed scheme.
Forward citations
Cited by 2 Pith papers
-
The Stein-log-Sobolev inequality and the exponential rate of convergence for the continuous Stein variational gradient descent method
For targets with a Gaussian lower bound, every kernel whose Fourier symbol decays quadratically yields a Stein-log-Sobolev inequality and exponential KL decay for the continuous SVGD flow.
-
Mean-Field Stochastic PDEs: Well-posedness and Quantitative Dimension-Free Propagation of Chaos
Mean-field stochastic PDEs with pseudo-monotone kernels are well-posed, and the many-particle convergence rate is a power of N governed by the uniform convexity of the solution space.
Discussion (0). Continue with ORCID to comment.