Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research establishes uniform-in-time convergence bounds for Persistent Contrastive Divergence algorithms by framing parameter updates and sampling as multiscale stochastic differential equations. The work provides quantitative error guarantees for training energy-based models, decomposing inaccuracies into numerical discretization, averaging effects, and concentration terms. By introducing efficient explicit stabilized integrators, the study offers a rigorous theoretical foundation for long-time stability in unsupervised learning methods.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

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

arXiv2 min read

arXiv:2510.01944v2 Announce Type: replace-cross Abstract: 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.

Abstract: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.

Machine Learning (stat.ML); Machine Learning (cs.LG)

arXiv:2510.01944 [stat.ML]

(or arXiv:2510.01944v2 [stat.ML] for this version)

https://doi.org/10.48550/arXiv.2510.01944 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 202 words

Related coverage