← Back to all news
arXiv Machine Learning By Andreas Maurer, Erfan Mirzaei, Massimiliano Pontil

Generalization of Gibbs and Langevin Monte Carlo Algorithms in the Interpolation Regime

Read the original on arXiv Machine Learning →

arXiv:2510. 06028v3 Announce Type: replace Abstract: This paper provides data-dependent bounds on the expected error of the Gibbs algorithm in the overparameterized interpolation regime, where low training errors are also obtained for impossible data, such as random labels in classification.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 16

Training Energy-Based Models with Non-MCMC Samplers and Efficient Temperature Estimation

The paper introduces Langevin simulated bifurcation (LSB), a fast, parallel Boltzmann sampler that matches the accuracy of sequential MCMC methods. It also proposes conditional expectation matching (CEM), an efficient technique for estimating the effective temperature of samples from energy‑based models with conditional independence. Building on these, the authors develop sampler adaptive learning (SAL), which adjusts the model temperature to align with the distribution produced by LSB, enabling efficient training of semi‑restricted Boltzmann machines (SRBMs) and outperforming conventional methods on synthetic spin‑glass datasets.

By Kentaro Kubo, Hayato Goto
More like this →