mlsanityData to 7 Oct 2026

Stochastic Gradient MCMC with Repulsive Forces

arXiv 1812.00071 ↗First posted 30 Nov 2018stat.ML cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Nov 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 4; 2023: 0; 2024: 4; 2025: 2; 2026: 4.

18 papers.

Sort:

By area: