English

Stochastic Gradient MCMC with Repulsive Forces

Machine Learning 2020-02-25 v2 Machine Learning

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.

Keywords

Cite

@article{arxiv.1812.00071,
  title  = {Stochastic Gradient MCMC with Repulsive Forces},
  author = {Victor Gallego and David Rios Insua},
  journal= {arXiv preprint arXiv:1812.00071},
  year   = {2020}
}

Comments

Extends the workshop version

R2 v1 2026-06-23T06:27:33.814Z