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. © 2013 American Physical Society.

Publication DOI: https://doi.org/10.1103/PhysRevE.88.013313
Divisions: College of Engineering & Physical Sciences > Systems analytics research institute (SARI)
Aston University (General)
Additional Information: © 2013 American Physical Society
Uncontrolled Keywords: Condensed Matter Physics,Statistical and Nonlinear Physics,Statistics and Probability
Publication ISSN: 1550-2376
Last Modified: 29 Oct 2024 12:54
Date Deposited: 21 Oct 2013 11:57
Full Text Link: http://journals ... sRevE.88.013313
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
PURE Output Type: Article
Published Date: 2013-07-31
Authors: C. Alamino, Roberto (ORCID Profile 0000-0001-8224-2801)
P. Neirotti, Juan (ORCID Profile 0000-0002-2409-8917)
Saad, David (ORCID Profile 0000-0001-9821-2623)

Download

[img]

Version: Published Version


Export / Share Citation


Statistics

Additional statistics for this record