mlsanityData to 7 Oct 2026

Interacting Contour Stochastic Gradient Langevin Dynamics

arXiv 2202.09867 ↗First posted 20 Feb 2022stat.ML cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

We propose an interacting contour stochastic gradient Langevin dynamics (ICSGLD) sampler, an embarrassingly parallel multiple-chain contour stochastic gradient Langevin dynamics (CSGLD) sampler with efficient interactions. We show that ICSGLD can be theoretically more efficient than a single-chain CSGLD with an equivalent computational budget. We also present a novel random-field function, which facilitates the estimation of self-adapting parameters in big data and obtains free mode explorations. Empirically, we compare the proposed algorithm with popular benchmark methods for posterior sampling. The numerical results show a great potential of ICSGLD for large-scale uncertainty estimation tasks.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 28 of its 67 references that are in the map. First posted on arXiv 20 Feb 2022.

Builds on

28 of 67 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  3. 2016Wide Residual Networkscited by 3,057
  4. 2017Random Erasing Data Augmentationcited by 1,235
  5. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
  6. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  7. 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
  8. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  9. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  10. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  11. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
  12. 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
16 more
  1. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  2. 2015Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networkscited by 121
  3. 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 96
  4. 2017A Hitting Time Analysis of Stochastic Gradient Langevin Dynamicscited by 70
  5. 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
  6. 2020A statistical theory of cold posteriors in deep neural networkscited by 53
  7. 2018Global Non-convex Optimization with Discretized Diffusionscited by 44
  8. 2016On the Convergence of Stochastic Gradient MCMC Algorithms with High-Order Integratorscited by 35
  9. 2019Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyondcited by 33
  10. 2020Non-convex Learning via Replica Exchange Stochastic Gradient MCMCcited by 33
  11. 2020A Contour Stochastic Gradient Langevin Dynamics Algorithm for Simulations of Multi-modal Distributionscited by 26
  12. 2018Stochastic Particle-Optimization Sampling and the Non-Asymptotic Convergence Theorycited by 20
  13. 2021On Convergence of Federated Averaging Langevin Dynamicscited by 14
  14. 2020Accelerating Convergence of Replica Exchange Stochastic Gradient MCMC via Variance Reductioncited by 10
  15. 2016Stochastic Gradient MCMC with Stale Gradientscited by 9
  16. 2016Interacting Particle Markov Chain Monte Carlocited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 3; 2025: 3.

9 papers.