mlsanityData to 7 Oct 2026

Uniform-in-time convergence bounds for Persistent Contrastive Divergence algorithms

arXiv 2510.01944 ↗First posted 2 Oct 2025stat.ML cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

We propose a continuous-time formulation of a noisy persistent contrastive divergence (PCD)-like method for maximum likelihood estimation (MLE) of unnormalised densities. Our approach couples parameter updates and sampling of the parametrised density in a multiscale system of stochastic differential equations (SDEs). From this formulation, we derive non-asymptotic bounds for weak test-function errors between the resulting numerical schemes and the MLE point target. The error is decomposed into numerical discretisation, slow-fast averaging, and finite-temperature concentration terms. We also introduce an efficient implementation based on explicit stabilized integrators and establish corresponding long-time error estimates. This leads to a novel method for training energy-based models (EBMs) with quantitative error guarantees.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 10 of its 39 references that are in the map. First posted on arXiv 2 Oct 2025.

Builds on

10 of 39 references.

References · 10

  1. 2019Your Classifier is Secretly an Energy Based Model and You Should Treat it Like Onecited by 402
  2. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
  3. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  4. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 144
  5. 2020Improved Contrastive Divergence Training of Energy Based Modelscited by 127
  6. 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
  7. 2021Learning to Compose Visual Relationscited by 72
  8. 2019Nonasymptotic estimates for Stochastic Gradient Langevin Dynamics under local conditions in nonconvex optimizationcited by 38
  9. 2023Interacting Particle Langevin Algorithm for Maximum Marginal Likelihood Estimationcited by 17
  10. 2022Maximum Likelihood Learning of Unnormalized Models for Simulation-Based Inferencecited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.