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: | Maria Chiara Angelini, Federico Ricci-Tersenghi |
---|---|
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 |
Similar Items
-
Entropic barriers as a reason for hardness in both classical and quantum algorithms
by: Matteo Bellitti, et al.
Published: (2021-10-01) -
Phase transitions in the mini-batch size for sparse and dense two-layer neural networks
by: Raffaele Marino, et al.
Published: (2024-01-01) -
Solving rehability redundancy allocation problem using simulated annealing algorithm /
by: Khodaei, Seyed Hossein, 1988-, et al.
Published: (2013) -
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
by: Pang, Li Sim
Published: (2010) -
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem /
by: Pang, Li Sim, 1986-, et al.
Published: (2010)