Susceptibility Propagation for Constraint Satisfaction Problems - Condensed Matter > Disordered Systems and Neural NetworksReport as inadecuate




Susceptibility Propagation for Constraint Satisfaction Problems - Condensed Matter > Disordered Systems and Neural Networks - Download this document for free, or read online. Document in PDF available to download.

Abstract: We study the susceptibility propagation, a message-passing algorithm tocompute correlation functions.
It is applied to constraint satisfactionproblems and its accuracy is examined.
As a heuristic method to find asatisfying assignment, we propose susceptibility-guided decimation wherecorrelations among the variables play an important role.
We apply this noveldecimation to locked occupation problems, a class of hard constraintsatisfaction problems exhibited recently.
It is shown that the present methodperforms better than the standard belief-guided decimation.



Author: Saburo Higuchi, Marc M├ęzard

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents