Microcanonical simulated annealing: Massively parallel Monte Carlo simulations with sporadic random-number generation
M. Bernaschi, C. Chilin, L.A. Fernandez, I. Gonz\'alez-Adalid Pemart\'in, E. Marinari, V. Martin-Mayor, G. Parisi, F. Ricci-Tersenghi, J.J. Ruiz-Lorenzo, D. Yllanes

TL;DR
This paper introduces a microcanonical simulated annealing algorithm optimized for massively parallel computing, significantly reducing random number usage in Monte Carlo simulations of complex systems like spin glasses.
Contribution
The authors develop a novel microcanonical simulated annealing method tailored for parallel architectures, decreasing the reliance on random numbers in Monte Carlo simulations.
Findings
MicSA performs comparably to standard simulations in equilibrium conditions.
The new algorithm is validated on GPU hardware against high-precision supercomputer results.
Off-equilibrium dynamics can be mapped onto standard results with simple time rescaling.
Abstract
Numerical simulations of models and theories that describe complex systems such as spin glasses are becoming increasingly important. Beyond fundamental research, these computational methods also find practical applications in fields like combinatorial optimization. However, Monte Carlo simulations, an important subcategory of these methods, are plagued by a major drawback: they are extremely greedy for (pseudo) random numbers. The total fraction of computer time dedicated to random-number generation increases as the hardware grows more sophisticated, and can get prohibitive for special-purpose computing platforms. We propose here a general-purpose microcanonical simulated annealing (MicSA) formalism that dramatically reduces such a burden. The algorithm is fully adapted to a massively parallel computation, as we show in the particularly demanding benchmark of the three-dimensional Ising…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
