Replication-based inference algorithms for hard computational problems.
Inference algorithms based on evolving interactions between replicated solutions are introduced and analyzed on a prototypical NP-hard problem: the capacity of the binary Ising perceptron. The efficiency of the algorithm is examined numerically against that of the parallel tempering algorithm, showing improved performance in terms of the results obtained, computing requirements and simplicity of implementation.
Non-linearity and Complexity Research Group, Aston University, Birmingham B4 7ET, United Kingdom.
Roberto C
RC
Alamino
Juan P
JP
Neirotti
David
D
Saad