Limits and Performances of Algorithms Based on Simulated Annealing in Solving Sparse Hard Inference Problems
The planted-coloring problem is a prototypical inference problem for which thresholds for Bayes-optimal algorithms, like belief propagation (BP), can be computed analytically. In this paper, we analyze the limits and performances of simulated annealing (SA), a Monte-Carlo-based algorithm that is mor...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2023-04-01
|
| Series: | Physical Review X |
| Online Access: | http://doi.org/10.1103/PhysRevX.13.021011 |