J . R . L. d e A lm e id a a n d D . J . T h o u le ss (1978). “Stability of the Sherrington- Kirkpatrick solution of a spin glass model” . J. Phys. A, 11:983.
R . J . B a x te r (1982). Exactly Solved Models in Statistical Mechanics. Academic, New York.
H . B e th e (1935). “Statistical theory of superlattices” . Proc. R. Soc. A, 150:552-575.
D . B ick so n , D . D o lev a n d Y . W eiss (2006). “Efficient large scale content distribu tion” . Technical Report TR-2006-07, Leibniz Center, The Hebrew University.
A . B r a u n s te in , M . M e z a rd a n d R . Z e c c h in a (2005). “Survey propagation: an algorithm for satisfiability” . Random Structures and Algorithms, 27(2):201-226. URL h ttp ://d x .d o i.o r g /1 0 .1 0 0 2 /r s a .2 0 0 5 7
A . B r a u n s te in a n d R . Z ec c h in a (2004). “Survey propagation as local equilibrium equations” . Journal of Statistical Mechanics: Theory and Experiment, 2004(06):P06007. URL h t t p : / / s t a c k s .i o p .o r g / 1 7 4 2 - 5468/2004/P06007
A . B r u n t o n a n d C . S hu (2006). “Belief propagation for panoram a generation” . In “Proceedings of the Third International Symposium on 3D D ata Processing, Visualiza tion and Transmission” , pages 885-892. Chapel Hill, NC, USA. ISBN 0-7695-2825-2.
M . C h e rtk o v a n d V . Y . C h e rn y a k (2006a). “Loop calculus helps to improve be lief propagation and linear programming decodings of low-density-parity-check codes” .
arXiv.org, arXiv:cs/0609154v1 [cs.IT].
URL h ttp ://a rx iv .o rg /a b s /c s /0 6 0 9 1 5 4 v 1
M . C h e rtk o v a n d V . Y . C h e rn y a k (2006b). “Loop series for discrete statistical models on graphs” . Journal of Statistical Mechanics: Theory and Experiment, 2006(06):P06009. URL h t t p : / / s t a c k s .i o p .o r g / 1 7 4 2 - 5468/2006/P06009
F . C h u , Y . W an g , D . S. P a r k e r a n d C. Z an io lo (2005). “D ata cleaning using belief propagation” . In “Proceedings of the 2nd international workshop on Information quality in information systems (IQIS’05)” , pages 99-104. ACM Press, New York, NY, USA. ISBN 1-59593-160-0.
A . C im a, A. v a n d e n E sse n , A . G a su ll, E. H u b b e r s a n d F . M a n o sa s (1997). “A polynomial counterexample to the Markus-Yamabe conjecture” . Advances in Mathe
G. C o o p e r (1990). “The com putational complexity of probabilistic inferences” . Artificial
Intelligence, 42(2-3):393-405.
J . C o u g h la n a n d H . S h e n (2004). “Shape matching with belief propagation: Using dynamic quantization to accomodate occlusion and clutter” . In “CVPRW ’04: Proceed ings of the 2004 Conference on Computer Vision and P a ttern Recognition Workshop (CVPRW ’04)” , volume 12, page 180. IEEE Computer Society, Washington, DC, USA. ISBN 0-7695-2158-4.
J . M . C o u g h la n a n d S. J . F e rr e ira (2002). “Finding deformable shapes using loopy belief propagation” . In “ECCV ’02: Proceedings of the 7th European Conference on Computer Vision-Part III” , pages 453-468. Springer-Verlag, London, UK. ISBN 3-540 43746-0.
URL h ttp ://w w w .sp rin g erlin k .co m /c o n ten t/a0 4 4 d p w 9 q l1 k p 0 r0 /
C. C rick a n d A. P fe ffe r (2003). “Loopy belief propagation as a basis for communication in sensor networks” . In “Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI-03)” , pages 159-16. Morgan Kaufmann, San Francisco, CA.
P. D a g u m a n d M . L u b y (1993). “Approximating probabilistic inference in Bayesian belief networks is N P-hard” . Artifical Intelligence, 60(1):141-153.
P. D a n g a u th ie r (2006). “Sudoku and belief propagation” . h t t p : / / e m o t i o n .i n r i a l p e s . fr/~ d a n g a u th ie r/b lo g /2 0 0 6 /0 3 /0 6 /s u d o k u -a n d -b e lie f-p ro p a g a tio n /.
R . D e c h te r, K . K a sk a n d R . M a te e s c u (2002). “Iterative join-graph propagation” . In “Proceedings of the 18th Annual Conference on Uncertainty in Artificial Intelligence (UAI-02)” , pages 128-13. Morgan Kaufmann, San Francisco, CA.
E . D e u ts c h (1975). “On m atrix norms and logarithmic norms” . Numerische Mathematik, 24(1):49-51.
J . D ie u d o n n e (1969). Foundations of Modern Analysis, volume 10-I of Pure and Applied
Mathematics. Academic Press, New York.
G. E lid a n , I. M c G ra w a n d D . K o lle r (2006). “Residual belief propagation: Informed scheduling for asynchronous message passing” . In “Proceedings of the 22nd Annual Conference on Uncertainty in Artificial Intelligence (UAI-06)” , Boston, Massachussetts.
P. F . F elze n szw alb a n d D. P. H u tte n lo c h e r (2004). “Efficient belief propagation for early vision” . In “Proceedings of the IEEE Computer Society Conference on Com puter Vision and P attern Recognition (CV PR’04)” , volume 01, pages 261-268. IEEE Computer Society, Los Alamitos, CA, USA. ISSN 1063-6919.
P. F . F elzen szw alb a n d D . P. H u tte n lo c h e r (2006). “Efficient belief propagation for early vision” . International Journal of Computer Vision, 70(1):41-54. ISSN 0920-5691.
W . T . F re e m a n , T . R . J o n e s a n d E. C. P a s z to r (2002). “Example-based super resolution” . IEEE Computer Graphics and Applications, 22(2):56-65.
W . T . F re e m a n , E. C . P a s z to r a n d O. T . C a rm ic h a e l (2000). “Learning low-level vision” . International Journal of Computer Vision, 40(1):25-47. ISSN 0920-5691.
b i b l i o g r a p h y 1 5 7
B. Frey and D. MacKay (1997). “A revolution: Belief propagation in graphs with cycles”. In “Advances in Neural Information Processing Systems”, volume 10, pages 479-485.
B. J. Frey, R. Koetter and N. Petrovic (2002). “Very loopy belief propagation for unwrapping phase images”. In “Advances in Neural Information Processing Systems (NIPS 2001)” , volume 14.
R. G. Gallager (1963). Low Density Parity Check Codes. M.I.T Press, Cambridge, Massachusetts.
J. Gao and J. Shi (2004). “Multiple frame motion inference using belief propagation”. In “Proceedings of the 6th IEEE International Conference on Automatic Face and Gesture Recognition 2004 (FGR 2004)”, pages 875-880.
H.-O. Georgii (1988). Gibbs Measures and Phase Transitions. Walter de Gruyter, Berlin.
V. Gomez, J. M . Mooij and H. J. Kappen (2007). “Truncating the loop series expansion for belief propagation”. Journal of Machine Learning Research, 8:1987-2016. URL http://www.jmlr.org/papers/volume8/gomez07a/gomez07a.pdf
M . D. Gupta, S. Rajaram , N. Petrovic and T. S. Huang (2005). “Non-parametric image super-resolution using multiple images”. In “IEEE International Conference on Image Processing (ICIP 2005)”, volume 2, pages 89-92.
T. Heskes (2004). “On the uniqueness of loopy belief propagation fixed points”. Neural
Computation, 16(11):2379-2413.
T. Heskes (2006). “Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies”. Journal of Artificial Intelligence Research, 26:153-190.
T. Heskes, C. A. Albers and H. J. Kappen (2003). “Approximate inference and con strained optimization”. In “Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI-03)”, pages 313-320. Morgan Kaufmann Publishers, San Francisco, CA.
T. Heskes, M . Opper, W . Wiegerinck, O. W inther and O. Zoeter (2005). “Ap proximate inference techniques with expectation constraints”. Journal of Statistical
Mechanics: Theory and Experiment, 2005(11):P11015.
URL http://stacks.iop.org/1742-5468/2005/P11015
A. Ihler (2007). “Accuracy bounds for belief propagation”. In “Proceedings of the 23th Annual Conference on Uncertainty in Artificial Intelligence (UAI-07)”, .
A. T. Ihler, J. W . Fisher and A. S. Willsky (2005a). “Loopy belief propagation: Convergence and effects of message errors”. Journal of Machine Learning Research, 6:905-936.
A. T. Ihler, J. W . Fisher and A. S. W illsky (2005b). “Message errors in belief propagation”. In L. K. Saul, Y. Weiss and L. Bottou, editors, “Advances in Neural In formation Processing Systems 17 (NIPS*2004)”, pages 609-616. MIT Press, Cambridge, MA.
A. T. Ihler, J. W . F. III, R. L. Moses and A. S. Willsky (2005c). “Nonparametric belief propagation for self-localization of sensor networks”. IEEE Journal on Selected
Areas in Communications, 23(4):809-819.
T. Jaakkola and M . I. Jordan (1999). “Variational probabilistic inference and the QMR-DT network”. Journal of Artificial Intelligence Research, 10:291-322.
URL http://www.jair.org/papers/paper583.html
T. S. Jaakkola and M . Jordan (1996). “Recursive algorithms for approximating prob abilities in graphical models”. In “Proc. Conf. Neural Information Processing Systems (NIPS 9)”, pages 487-493. Denver, CO.
Y. Kabashima (2003). “Propagating beliefs in spin glass models”. J. Phys. Soc. Japan, 72:1645-1649.
H. Kamisetty, E. P. X ing and C. J. Langmead (2006). “Free energy estimates of all-atom protein structures using generalized belief propagation”. Technical Report CMU-CS-06-160, Carnegie Mellon University.
URL http://reports-archive.adm.cs.cmu.edu/anon/2006/CMU-CS-06- 160.pdf R. Kikuchi (1951). “A theory of cooperative phenomena”. Phys. Rev., 81:988-1003. F. R. Kschischang, B. J. Frey and H.-A. Loeliger (2001). “Factor graphs and the
sum-product algorithm”. IEEE Trans. Inform. Theory, 47(2):498-519.
Y. A. Kuznetsov (1988). Elements of Applied Bifurcation Theory, volume 112 of Applied
Mathematical Sciences. Springer, New York, 2nd edition.
S. L. Lauritzen and D. J. Spiegelhalter (1988). “Local computations with probabili ties on graphical structures and their application to expert systems”. J. Royal Statistical
Society B, 50:154-227.
M . Leisink and B. Kappen (2003). “Bound propagation”. Journal of Artificial Intel
ligence Research, 19:139-154.
M . A. R. Leisink and H. J. Kappen (2001). “A tighter bound for graphical mod els”. In L. K. Saul, Y. Weiss and L. Bottou, editors, “Advances in Neural Information Processing Systems 13 (NIPS*2000)”, pages 266-272. MIT Press, Cambridge, MA. M . Leone, A. Vazquez, A. Vespignani and R . Zecchina (2002). “Ferromagnetic
ordering in graphs with arbitrary degree distribution”. Eur. Phys. Jour. B, 28:191 - 197.
R. J. McEliece, D. J. C. MacKay and J.-F. Cheng (1998). “Turbo decoding as an instance of Pearl’s ‘belief propagation’ algorithm”. IEEE J. Select. Areas Commun., 16:140-152.
C. D. Meyer (2000). Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia. M . Mezard and G. Parisi (2001). “The Bethe lattice spin glass revisited”. Eur. Phys.
b i b l i o g r a p h y 1 5 9
M . Maezard, G. Parisi and M . A. Virasoro (1987). Spin Glass Theory and Beyond. World Scientific, Singapore.
M . Mezard and R. Zecchina (2002). “Random K-satisfiability: from an analytic solution to a new efficient algorithm”. Phys. Rev. E, 66:056126.
T. Minka (2001). “Expectation propagation for approximate Bayesian inference”. In “Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence (UAI-01)”, pages 362-369. Morgan Kaufmann Publishers, San Francisco, CA.
T. Minka and Y. Qi (2004). “Tree-structured approximations by expectation propaga tion”. In S. Thrun, L. Saul and B. Scholkopf, editors, “Advances in Neural Information Processing Systems 16”, MIT Press, Cambridge, MA.
A. M ontanari and T. Rizzo (2005). “How to compute loop corrections to the Bethe approximation”. Journal of Statistical Mechanics: Theory and Experiment, 2005(10):P10011.
URL http://stacks.iop.org/1742-5468/2005/P10011
J. M . Mooij and H. J. Kappen (2005a). “On the properties of the Bethe approximation and loopy belief propagation on binary networks”. Journal of Statistical Mechanics:
Theory and Experiment, 2005(11):P11012.
URL http://stacks.iop.org/1742-5468/2005/P11012
J. M . Mooij and H. J. Kappen (2005b). “Sufficient conditions for convergence of loopy belief propagation”. In F. Bacchus and T. Jaakkola, editors, “Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence (UAI-05)” , pages 396-403. AUAI Press, Corvallis, Oregon.
J. M . Mooij and H. J. Kappen (2005c). “Validity estimates for loopy belief propa gation on binary real-world networks”. In L. K. Saul, Y. Weiss and L. Bottou, editors,
“Advances in Neural Information Processing Systems 17 (NIPS*2004)”, pages 945-952. MIT Press, Cambridge, MA.
J. M . Mooij and H. J. Kappen (2006). “Loop corrections for approximate inference”.
arXiv.org, arXiv:cs/0612030v1 [cs.AI].
URL http://arxiv.org/abs/cs/0612030v1
J. M . Mooij and H. J. Kappen (2007a). “Loop corrections for approximate inference on factor graphs”. Journal of Machine Learning Research, 8:1113-1143.
URL http://www.jmlr.org/papers/volume8/mooij07a/mooij07a.pdf
J. M . Mooij and H. J. Kappen (2007b). “Sufficient conditions for convergence of the sum-product algorithm”. IEEE Transactions on Information Theory, 53(12):4422-4437. J. M . Mooij and H. J. Kappen (2008). “Novel bounds on marginal probabilities”.
arXiv.org, arXiv:0801.3797 [math.PR]. Submitted to Journal of Machine Learning Re
search.
J. M . Mooij, B. Wemmenhove, H. J. Kappen and T. Rizzo (2007). “Loop corrected belief propagation”. In “Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics (AISTATS-07)”, volume 11.
URL http://www.stat.umn.edu/~aistat/proceedings/start.htm
K. Murphy, Y. Weiss and M . Jordan (1999). “Loopy belief propagation for approx imate inference: an empirical study”. In “Proc. of the Conf. on Uncertainty in AI”, pages 467-475.
K. Nakanishi (1981). “Two- and three-spin cluster theory of spin-glasses”. Physical
Review B, 23(7).
M . E. J. Newman, S. H. Strogatz and D. J. W atts (2001). “Random graphs with arbitrary degree distributions and their applications”. Phys. Rev. E, 64:026118. H. Nishimori (2001). Statistical Physics of Spin Glasses and Information Processing -
an Introduction. Oxford Press, Oxford.
M . Opper and O. W inter (2005). “Expectation consistent approximate inference”.
Journal of Machine Learning Research, 6:2177-2204.
G. Parisi (1988). Statistical Field Theory. Addison-Wesley, Redwood City, Ca.
G. Parisi and F. Slanina (2006). “Loop expansion around the Bethe-Peierls approxi mation for lattice models”. Journal of Statistical Mechanics: Theory and Experiment, 2006(02):L02003.
URL http://stacks.iop.org/1742-5468/2006/L02003
J. Pearl (1988). Probabilistic Reasoning in Intelligent systems: Networks of Plausible
Inference. Morgan Kaufmann, San Francisco, CA.
J. Pearl (2000). Causality: Models, Reasoning, and Inference. Cambridge University Press.
R. E. Peierls (1936). “On Isings model of ferromagnetism”. Proc. Cambridge Philos.
Soc., 32:477.
A. Pelizzola (2005). “Cluster variation method in statistical physics and probabilistic graphical models”. J. Phys. A: Math. Gen., 38:R309-R339.
N. Petrovic, I. Cohen, B. J. Frey, R. Koetter and T. S. Huang (2001). “Enforcing integrability for surface reconstruction algorithms using belief propagation in graphical models”. IEEE Computer Society Conference on Computer Vision and Pattern Recog
nition (CVPR’01), 01:743. ISSN 1063-6919.
D. R oth (1996). “On the hardness of approximate reasoning”. Artificial Intelligence, 82(1-2):273-302.
A. D. Scott and A. D. Sokal (2005). “The repulsive lattice gas, the independent-set polynomial, and the lovasz local lemma”. Journal of Statistical Physics, 118:1151-1261.
b i b l i o g r a p h y 161
M . A. Shwe, B. Middleton, D. E. Heckerman, M . Henrion, E. J. Horvitz, H. P. Lehmann and G. F. Cooper (1991). “Probabilistic diagnosis using a reformulation of the INTERNIST-1/QMR knowledge base. I. The probabilistic model and inference algorithms”. Methods of information in Medicine, 30(4):241-255.
E. Sudderth, A. Ihler, W . Freeman and A. Willsky (2003). “Nonparametric belief propagation”. In “Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR’03)”, .
E. Sudderth, M . Mandel, W . Freeman and A. Willsky (2004). “Visual hand tracking using nonparametric belief propagation”. Technical Report 2603, MIT LIDS Technical Report.
J. Sun, N.-N. Zheng and H.-Y. Shum (2003). “Stereo matching using belief propaga tion”. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(7):787-800. ISSN 0162-8828.
N. Taga and S. Mase (2006a). “Error bounds between marginal probabilities and beliefs of loopy belief propagation algorithm”. In “MICAI”, pages 186-196.
URL http://dx.doi.org/10.1007/11925231_18
N. Taga and S. Mase (2006b). “On the convergence of loopy belief propagation algo rithm for different update rules”. IEICE Trans. Fundamentals, E89-A(2):575-582. M . Takikawa and B. D ’Ambrosio (1999). “Multiplicative factorization of noisy-max”.
In “Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence (UAI-99)”, pages 622-63. Morgan Kaufmann, San Francisco, CA.
K. Tanaka (2002). “Statistical-mechanical approach to image processing”. Journal of
Physics A: Mathematical and General, 35(37):R81-R150.
URL http://stacks.iop.org/0305-4470/35/R81
M . F. Tappen and W . T. Freeman (2003). “Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters”. In “ICCV ’03: Proceedings of the Ninth IEEE International Conference on Computer Vision”, page 900. IEEE Computer Society, Washington, DC, USA. ISBN 0-7695-1950-4.
S. C. Tatikonda (2003). “Convergence of the sum-product algorithm”. In “Proceedings 2003 IEEE Information Theory Workshop”, pages 222-225.
S. C. Tatikonda and M . I. Jordan (2002). “Loopy belief propagation and Gibbs measures”. In “Proc. of the 18th Annual Conf. on Uncertainty in Artificial Intelligence (UAI-02)”, pages 493-500. Morgan Kaufmann Publishers, San Francisco, CA.
P. J. Villeneuve and Y . Mao (1994). “Lifetime probability of developing lung cancer, by smoking status, canada”. Canadian Journal of Public Health, 85(6):385-8.
M . J. Wainwright, T. Jaakkola and A. S. Willsky (2005). “A new class of upper bounds on the log partition function”. IEEE Transactions on Information Theory, 51:2313-2335.
Y. Weiss (2000). “Correctness of local probability propagation in graphical models with loops”. Neur. Comp., 12:1-41.
Y. Weiss and W . T. Freeman (2001). “On the optimality of solutions of the max- product belief propagation algorithm in arbitrary graphs”. IEEE Transactions on In
formation Theory, 47(2):736-744.
D. Weitz (2006). “Counting independent sets up to the tree threshold”. In “Proceedings ACM symposium on Theory of Computing”, page 140149. ACM.
M . Welling, T. Minka and Y. W . Teh (2005). “ Structured region graphs: Morphing EP into GBP”. In “Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence (UAI-05)”, page 609. AUAI Press, Arlington, Virginia.
M . Welling and Y . W . Teh (2001). “Belief optimization for binary networks: A stable alternative to loopy belief propagation”. In “Proc. of the 17th Annual Conf. on Uncertainty in Artificial Intelligence (UAI-01)”, pages 554-561. Morgan Kaufmann Publishers, San Francisco, CA.
B. Wemmenhove, J. M . Mooij, W . Wiegerinck, M . Leisink, H. J. Kappen and J. P. Neijt (2007). “Inference in the Promedas medical expert system”. In “Pro ceedings of the 11th Conference on Artificial Intelligence in Medicine (AIME 2007)”, volume 4594 of Lecture Notes in Computer Science, pages 456-460. Springer. ISBN 978-3-540-73598-4.
B. Wemmenhove, T. Nikoletopoulos and J. P. L. Hatchett (2004). “Replica sym metry breaking in the ‘small world’ spin glass”. arXiv.org, arXiv:cond-mat/0405563v1 [cond-mat.dis-nn].
URL http://arxiv.org/abs/cond-mat/0405563v1
W . Wiegerinck and T. Heskes (2003). “Fractional belief propagation”. In S. T. S. Becker and K. Obermayer, editors, “Advances in Neural Information Processing Systems 15”, pages 438-445. MIT Press, Cambridge, MA.
W . Wiegerinck, H. J. Kappen, E. W . M . T. ter Braak, W . J. P. P. ter Burg, M . J. Nijman, Y. L. O and J. P. Neijt (1999). “Approximate inference for medical diagnosis”. Pattern Recognition Letters, 20:1231-1239.
J. S. Yedidia, W . T. Freeman and Y. Weiss (2001). “ Generalized belief propaga