mlsanityData to 14 Oct 2026

Enhancing Gradient-based Discrete Sampling via Parallel Tempering

arXiv 2502.19240 ↗First posted 26 Feb 2025stat.ML cs.LG stat.APcited by 1

Not on the map. Why?

Abstract (arXiv)

While gradient-based discrete samplers are effective in sampling from complex distributions, they are susceptible to getting trapped in local minima, particularly in high-dimensional, multimodal discrete distributions, owing to the discontinuities inherent in these landscapes. To circumvent this issue, we combine parallel tempering, also known as replica exchange, with the discrete Langevin proposal and develop the Parallel Tempering enhanced Discrete Langevin Proposal (PTDLP), which are simulated at a series of temperatures. Significant energy differences prompt sample swaps, which are governed by a Metropolis criterion specifically designed for discrete sampling to ensure detailed balance is maintained. Additionally, we introduce an automatic scheme to determine the optimal temperature schedule and the number of chains, ensuring adaptability across diverse tasks with minimal tuning. Theoretically, we establish that our algorithm converges non-asymptotically to the target energy and exhibits faster mixing compared to a single chain. Empirical results further emphasize the superiority of our method in sampling from complex, multimodal discrete distributions, including synthetic problems, restricted Boltzmann machines, and deep energy-based models.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 78 references that are in the map. First posted on arXiv 26 Feb 2025.

Builds on

25 of 78 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
  4. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 208
  5. 2019Cyclical Stochastic Gradient MCMC for Bayesian Deep Learningcited by 203
  6. 2019BERT has a Mouth, and It Must Speak: BERT as a Markov Random Field Language Modelcited by 185
  7. 2022Concrete Score Matching: Generalized Score Matching for Discrete Datacited by 148
  8. 2021Oops I Took A Gradient: Scalable Sampling for Discrete Distributionscited by 92
  9. 2023Introduction to Latent Variable Energy-Based Models: A Path Towards Autonomous Machine Intelligencecited by 56
  10. 2024Beyond ELBOs: A Large-Scale Evaluation of Variational Methods for Samplingcited by 56
  11. 2022A Langevin-like Sampler for Discrete Distributionscited by 44
  12. 2020Non-convex Learning via Replica Exchange Stochastic Gradient MCMCcited by 34
13 more
  1. 2020A Contour Stochastic Gradient Langevin Dynamics Algorithm for Simulations of Multi-modal Distributionscited by 26
  2. 2022Discrete Langevin Sampler via Wasserstein Gradient Flowcited by 24
  3. 2018Probabilistic Binary Neural Networkscited by 21
  4. 2018Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decompositioncited by 18
  5. 2020Accelerating Nonconvex Learning via Replica Exchange Langevin Diffusioncited by 16
  6. 2023Uncovering Meanings of Embeddings via Partial Orthogonalitycited by 15
  7. 2016An Efficient Minibatch Acceptance Test for Metropolis-Hastingscited by 11
  8. 2020Accelerating Convergence of Replica Exchange Stochastic Gradient MCMC via Variance Reductioncited by 10
  9. 2022Optimal Scaling for Locally Balanced Proposals in Discrete Spacescited by 9
  10. 2024Gradient-based Discrete Sampling with Automatic Cyclical Schedulingcited by 9
  11. 2022Non-reversible Parallel Tempering for Deep Posterior Approximationcited by 7
  12. 2023Efficient Informed Proposals for Discrete Distributions via Newton's Series Approximationcited by 7
  13. 2022Improving multiple-try Metropolis with local balancingcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.