Haiping Huang, Haijun Zhou
We formulate the solution counting problem within the framework of inverse
Ising problem and use fast belief propagation equations to estimate the entropy
whose value provides an estimate on the true one. We test this idea on both
diluted models (random 2-SAT and 3-SAT problems) and 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 Monte Carlo method. Of particular
significance is sizes of other metastable states for this real neuronal network
are predicted.
View original:
http://arxiv.org/abs/1111.4278
No comments:
Post a Comment