Constraint satisfaction problems and neural networks: A statistical physics perspective

Journal of Physiology Paris

Volumn 103, Issue 1-2, 2009, Pages 107-113

  Mézard, Marc ^a   Mora, Thierry ^b  

^a UNIVERSITÉ PARIS SUD   (France)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; DATA ANALYSIS; NERVE CELL NETWORK; NEUROBIOLOGY; PHYSICS; PROBLEM SOLVING; STATISTICS; THEORY;

ALGORITHMS; ANIMALS; COMPUTER SIMULATION; HUMANS; MODELS, NEUROLOGICAL; NEURAL NETWORKS (COMPUTER); NEURONS;

EID: 70149115237     PISSN: 09284257     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jphysparis.2009.05.013     Document Type: Article

References (31)

1. Ackley D.H., Hinton G.E., and Sejnowski T.J. A Learning Algorithm for Boltzmann Machines (1987), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA pp. 522-533
2. Baldassi C., Braunstein A., Brunel N., and Zecchina R. Efficient supervised learning in networks with binary synapses. Proceedings of the National Academy of Science 104 (2007) 11079
3. Blum A.L., and Rivest R.L. Training a 3-node neural network is np-complete. Neural Networks 5 (1992) 117-127
4. Braunstein A., Mézard M., and Zecchina R. Survey propagation: an algorithm for satisfiability. Random Structures and Algorithms 27 (2005) 201-226
5. Braunstein A., and Zecchina R. Learning by message passing in networks of discrete synapses. Physical Review Letters 96 (2006) 030201
6. Broderick, T., Dudik, M., Tkacik, G., Schapire, R.E., Bialek, W., 2007. Faster solutions of the inverse pairwise Ising problem. E-print arXiv:0712.2437.
7. Cook, S.A., 1971. The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, pp. 151-158.
8. Friedgut E. Sharp thresholds of graph properties and the k-sat problem. Journal of the American Mathematical Society 12 (1999) 1017-1054
9. Gallager R.G. Low-Density Parity-Check Codes (1963), MIT Press, Cambridge, Massachussetts
10. Jaynes E.T. Information theory and statistical mechanics. Physiological Reviews 106 & 108 (1949) 620-630 171-190 resp
11. Kappen H.J., and Rodriguez F.B. Efficient learning in Boltzmann machines using linear response theory. Neural Computation 10 (1998) 1137-1156
12. Kirkpatrick S., and Selman B. Critical behavior in the satisfiability of random boolean expressions. Science 264 (1994) 1297-1301
13. Krauth W., and Mézard M. Storage capacity of memory networks with binary couplings. Journal de Physique France 50 (1989) 3057-3066
14. Kschischang F.R., Frey B.J., and Loeliger H.-A. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47 (2001) 498-519
15. Mézard, M., Montanari, A., 2009. Information, Physics and Computation. Oxford University Press.
16. Mézard M., Parisi G., and Zecchina R. Analytic and algorithmic solution of random satisfiability problems. Science 297 (2003) 812-815 doi:10.1126/science.1073287 (Published online June 27, 2002)
17. Mézard M., and Zecchina R. The random k-satisfiability problem: from an analytic solution to an efficient algorithm. Physical Review E 66 (2002) 056126
18. Monasson R., Zecchina R., Kirkpatrick S., Selman B., and Troyansky L. Determining computational complexity from characteristic phase transitions. Nature 400 (1999) 133-137
19. Montanari A., and Urbanke R. Modern coding theory: the statistical mechanics and computer science point of view. Complex Systems, Proceedings of the 85th Les Houches School (2007), Elsevier, Amsterdam, The Netherlands
20. O'Connor D.H., Wittenberg G.M., and Wang S.S.-H. Graded bidirectional synaptic plasticity is composed of switch-like unitary events. Proceedings of the National Academy of Science 102 (2005) 9679-9684
21. Petersen C.C.H., Malenka R.C., Nicoll R.A., and Hopfield J.J. All-or-none potentiation at CA3-CA1 synapses. Proceedings of the National Academy of Science 95 (1998) 4732-4737
22. Richardson, T., Urbanke, R., 2006. Modern Coding Theory. Cambridge University Press. http://lthcwww.epfl.ch/mct/index.php.
23. Rosenblatt F. Principles of Neurodynamics (1962), Spartan, New York
24. Russ W.P., Lowery D.M., Mishra P., Yaffe M.B., and Ranganathan R. Natural-like function in artificial WW domains. Nature 437 (2005) 579-583
25. Schneidman E., Berry M.J., Segev R., and Bialek W. Weak pairwise correlations imply strongly correlated network states in a neural population. Nature 440 (2006) 1007-1012
26. Schneidman E., Still S., Berry M.J., and Bialek W. Network information and connected correlations. Physical Review Letters 91 (2003) 238701
27. Selman B., and Kirkpatrick S. Critical behavior in the computational cost of satisfiability testing. Artificial Intelligence 81 (1996) 273-295
28. Socolich M., Lockless S.W., Russ W.P., Lee H., Gardner K.H., and Ranganathan R. Evolutionary information for specifying a protein fold. Nature 437 (2005) 512-518
29. Stephens, G.J., Bialek, W., 2007. Toward a statistical mechanics of four letter words. E-print arXiv:0801.0253.
30. Tkacik, G., 2007. Information flow in biological networks. PhD dissertation, Princeton University.
31. Yedidia J.S., Freeman W.T., and Weiss Y. Generalized belief propagation. Advances in Neural Information Processing Systems (NIPS) (2001), MIT Press 689-695