nips nips2001 nips2001-119 nips2001-119-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Martijn Leisink, Bert Kappen
Abstract: The partition function for a Boltzmann machine can be bounded from above and below. We can use this to bound the means and the correlations. For networks with small weights, the values of these statistics can be restricted to non-trivial regions (i.e. a subset of [-1 , 1]). Experimental results show that reasonable bounding occurs for weight sizes where mean field expansions generally give good results. 1
[1] C. Peterson and J. Anderson. A mean field theory learning algorithm for neural networks. Co mplex systems, 1:995- 1019, 1987.
[2] S.K. Saul, T.S . Jaakkola, and M.l. Jordan. Mean field theory for sigmoid b elief networks. Journal of Artific ial Intelligence Research, 4:61- 76 , 1996.
[3] Martijn A.R. Leisink and Hilbert J. Kapp en. A tighter bound for graphical models. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 266- 272. M IT Press, 2001.
[4] Martijn A.R. Leisink and Hilbert J. Kappen. A tighter bound for graphical models. Neural Co mputation, 13(9) , 2001. To appear.
[5] T. Jaakkola and M.l. Jordan. Recursive algorithms for approximating probabilities in graphical models. MIT Co mpo Cogn. Sc ience Technical Report 9604, 1996.
[6] Tommi S. Jaakkola and Michael 1. Jordan. Computing upp er and lower bounds on likelihoods in intractable n etworks. In Proceedings of th e T welfth Annual Conf ere nce on Uncertainty in Artificial Intelligence (UAI- 96) , pages 340- 348, San Francisco , CA, 1996. Morgan Kaufmann Publishers.
[7] D. Ackley, G. Hinton, and T. Sejnowski. A learning algorithm for Boltzmann machines. Cognitive Science, 9:147-169, 1985.
[8] D. Sherrington and S. Kirkpatrick. Solvable model of a spin-glass. Physi cal R eview Letters, 35(26):1793-1796, 121975.
[9] T. Plefka. Convergence condition of the TAP equation for the infinite-ranged ising spin glass model. J.Phys.A: Math. Gen., 15:1971-1978, 1981.