arXiv · 1305.2754
Replication-based Inference Algorithms for Hard Computational Problems
Abstract
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.
Explore related subjects
Keep this discovery
Roberto C. Alamino, Juan P. Neirotti, David Saad. 2013-05-13. Replication-based Inference Algorithms for Hard Computational Problems. https://doi.org/10.1103/physreve.88.013313
Cite the original work for its findings. Save a collection to share your selection of sources.