View in EDS

Demonstrating real advantage of machine learning–enhanced Monte Carlo for combinatorial optimization.

Saved in:
Bibliographic Details
Title: Demonstrating real advantage of machine learning–enhanced Monte Carlo for combinatorial optimization.
Authors: Del Bono, Luca Maria1,2, Ricci-Tersenghi, Federico1,2,3 federico.ricci@uniroma1.it, Zamponi, Francesco1 francesco.zamponi@uniroma1.it
Source: Proceedings of the National Academy of Sciences of the United States of America. 5/12/2026, Vol. 123 Issue 19, p1-10. 10p.
Subjects: Combinatorial optimization, Monte Carlo method, Machine learning, Simulated annealing
Abstract: Combinatorial optimization problems are central to both practical applications and the development of optimization methods. While classical and quantum algorithms have been refined over decades, machine learning–assisted approaches are comparatively recent and have not yet consistently outperformed simple, state-of-the-art classical methods. Here, we focus on a class of Quadratic Unconstrained Binary Optimization problems, specifically the challenge of finding minimum energy configurations in three-dimensional Ising spin glasses. We use a Global Annealing Monte Carlo algorithm that integrates standard local moves with global moves proposed via machine learning. We show that local moves play a crucial role in achieving optimal performance. Benchmarking against Simulated Annealing and Population Annealing, we demonstrate that Global Annealing not only surpasses the performance of Simulated Annealing but also exhibits greater robustness than Population Annealing, maintaining effectiveness across problem hardness and system size without hyperparameter tuning. These results provide clear and robust evidence that a machine learning–assisted optimization method can exceed the capabilities of classical state-of-the-art techniques in a combinatorial optimization setting. [ABSTRACT FROM AUTHOR]
Copyright of Proceedings of the National Academy of Sciences of the United States of America is the property of National Academy of Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Combinatorial optimization problems are central to both practical applications and the development of optimization methods. While classical and quantum algorithms have been refined over decades, machine learning–assisted approaches are comparatively recent and have not yet consistently outperformed simple, state-of-the-art classical methods. Here, we focus on a class of Quadratic Unconstrained Binary Optimization problems, specifically the challenge of finding minimum energy configurations in three-dimensional Ising spin glasses. We use a Global Annealing Monte Carlo algorithm that integrates standard local moves with global moves proposed via machine learning. We show that local moves play a crucial role in achieving optimal performance. Benchmarking against Simulated Annealing and Population Annealing, we demonstrate that Global Annealing not only surpasses the performance of Simulated Annealing but also exhibits greater robustness than Population Annealing, maintaining effectiveness across problem hardness and system size without hyperparameter tuning. These results provide clear and robust evidence that a machine learning–assisted optimization method can exceed the capabilities of classical state-of-the-art techniques in a combinatorial optimization setting. [ABSTRACT FROM AUTHOR]
ISSN:00278424
DOI:10.1073/pnas.2534768123