Global Annealing Monte Carlo with ML global moves plus local updates outperforms Simulated Annealing and is more robust than Population Annealing on 3D Ising spin glasses without hyperparameter tuning.
Monte carlo algorithms are very effective in finding the largest independent set in sparse random graphs.Phys- ical Review E, 100(1):013302
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.dis-nn 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Demonstrating Real Advantage of Machine-Learning-Enhanced Monte Carlo for Combinatorial Optimization
Global Annealing Monte Carlo with ML global moves plus local updates outperforms Simulated Annealing and is more robust than Population Annealing on 3D Ising spin glasses without hyperparameter tuning.