Skip to content

Nonlocal Transition Kernel for Efficient Learning of Restricted Boltzmann Machines

Aug 2026 · 0 citations · 28 references
Mathematics Physics Computer Science

TL;DR

A transition kernel defined over the RBM sequence used in DT is proposed, enabling nonlocal moves within a single transition while leaving the RBM sequence invariant and mitigates the training failures observed with BGS- and DT-based learning.

Abstract

Learning restricted Boltzmann machines (RBMs) is computationally challenging because it requires expectations whose exact evaluation is generally intractable. The expectations are typically evaluated using a sampling approximation based on blocked Gibbs sampling (BGS), which is a local Markov chain Monte Carlo transition kernel. However, the locality of BGS can lead to poor sampling quality when the RBM has high energy barriers, thereby degrading learning performance. Deep tempering (DT), which performs parallel tempering over a sequence of learnable RBMs including the training RBM, alleviates this locality issue. However, DT algorithmically requires multiple steps to move through the RBM sequence to achieve a nonlocal transition. In this paper, we propose a transition kernel defined over the RBM sequence used in DT. The proposed kernel has a round-trip structure over the sequence, enabling nonlocal moves within a single transition while leaving the RBM sequence invariant. Numerical experiments show that the proposed kernel performs nonlocal transitions more frequently and achieves higher sampling quality with fewer transitions than BGS and DT. We further verify that learning based on the proposed kernel is more stable and mitigates the training failures observed with BGS- and DT-based learning.

View source

Similar papers

#machine learning Preprint Sep 2026

HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC

Experiments on logistic regression, probabilistic matrix factorization, and Bayesian neural networks show that HyperMC improves posterior approximation or predictive calibration relative to MAMBA, grid search, and heuristic baselines, while Robust HyperMC yields more stable and reproducible tuning results.

Min-Chin Tan, Xi-Yun Jiao · 0 citations
#machine learning Preprint Jul 2026

Equilibrium Training of Energy-Based Models with Parallel Trajectory Tempering

Energy-Based Models (EBMs) provide an interpretable framework for generative modeling of scientific data, but poor Markov Chain Monte Carlo mixing often limits their reliability. We introduce a training algorithm based on Parallel Trajectory Tempering (PTT), which exploits the continuity of the optimization path to mai...

Nicolas B'ereux, A. Decelle, Cyril Furtlehner et al. · 0 citations
#machine learning Preprint Jul 2026

Neural Non-Equilibrium Hamiltonian Monte Carlo for Corrected Boltzmann Sampling

Sampling from an unnormalized Boltzmann density requires proposals that move probability mass globally while retaining enough path-probability information for statistical correction. We introduce Neural Non-Equilibrium Hamiltonian Monte Carlo (NHMC), a train-then-correct learned Hamiltonian sampler. Starting from a tra...

Mo-Xian Qian · 1 citation
#machine learning Preprint Sep 2026

When Metropolis and Hastings Meet Bradley and Terry: Exact MCMC From Preference Voting

This work introduces Pref-MH, a general exact MH sampler for judge-induced conditional distributions using only stochastic binary pairwise comparisons, and develops a valid accept/reject rule whose resulting Markov chain provably converges to the target distribution.

Ariel Smogorghevski, Nir Rosenfeld, Yaniv Romano · 0 citations
Open access Jun 2024

Parallel MCMC via machine learning classification and a Kullback–Leibler divergence criterion

This study develops a Kullback–Leibler (KL) divergence-based criterion that does not require calculating the full-posterior density and can be calculated using only information from the sub-posterior densities, which are generally obtained after implementing MCMC.

Tomoki Matsumoto · 0 citations
Preprint Jul 2026

Equivariant Continuous Normalizing Flows with Offline Sampling for Fermionic Ground State Estimation

An augmented dynamics formulation for kinetic energy computation that co-evolves the required derivative quantities as ODE state variables, eliminating differentiation through the ODE trajectory and yielding significant reductions in wall-clock time and memory is introduced.

S. Cochran, James B. Larsen, Andrew Wray et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.