Abstract
We formulate the solution counting problem within the framework of the inverse Ising problem and use fast belief propagation equations to estimate the entropy whose value provides an estimate of the true one. We test this idea on both diluted models [random 2-SAT (2-satisfiability) and 3-SAT problems] and a fully connected model (binary perceptron), and show that when the constraint density is small, this estimate can be very close to the true value. The information stored by the salamander retina under the natural movie stimuli can also be estimated, and our result is consistent with that obtained by the Monte Carlo method. Of particular significance is that the sizes of other metastable states for this real neuronal network are predicted.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
