Skip to main content

Theoretical Analysis of Accuracy of Gaussian Belief Propagation

  • Conference paper
Artificial Neural Networks – ICANN 2007 (ICANN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4668))

Included in the following conference series:

Abstract

Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true marginal probabilities when the graph describing the target distribution has a tree structure, while do approximate marginal probabilities when the graph has loops. The accuracy of loopy belief propagation (LBP) has been studied. In this paper, we focus on applying LBP to a multi-dimensional Gaussian distribution and analytically show how accurate LBP is for some cases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Weiss, Y.: Belief propagation and revision in networks with loops, Technical Report 1616, MIT AI lab (1997)

    Google Scholar 

  2. Aji, S.M., Horn, G.B., McEliece, R.J.: On the convergence of iterative decoding on graphs with a single cycle. In: proc. 1998 ISIT (1998)

    Google Scholar 

  3. Weiss, Y.: Correctness of local probability propagation in graphical models with loops. Neural Computation 12(1), 1–41 (2000)

    Article  MATH  Google Scholar 

  4. Weiss, Y., Freeman, W.: Correctness of belief propagation in graphical models with arbitrary topology. Neural Computation 13(10), 2173–2200 (2001)

    Article  MATH  Google Scholar 

  5. Ikeda, S., Tanaka, T., Amari, S.: information geometry of turbo and low-density parity-check codes. IEEE Trans. Inf. Theory 50(6), 1097–1114

    Google Scholar 

  6. Ikeda, S., Tanaka, T., Amari, S.: Stochastic reasoning, free energy, and information geometry. Neural Computation 16(9), 1779–1810 (2004)

    Article  MATH  Google Scholar 

  7. Tanaka, K., Shouno, H., Okada, M.: Accuracy of the Bethe approximation for hyperparameter estimation in probabilistic image processing. J. Phys. A, Math. Gen. 37(36), 8675–8696 (2004)

    Article  MATH  Google Scholar 

  8. Tanaka, K.: Generalized Belief Propagation Formula in Probabilistic Information Processing Based on Gaussian Graphical Model. IEICE D-II J88-D-II(12), 2368–2379 (2005)

    Google Scholar 

  9. Nishiyama, Y., Watanabe, S.: Theoretical Analysis of Accuracy of Belief Propagation in Gaussian Models. IEICE Technical Report 107(50), 23–28 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joaquim Marques de Sá Luís A. Alexandre Włodzisław Duch Danilo Mandic

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nishiyama, Y., Watanabe, S. (2007). Theoretical Analysis of Accuracy of Gaussian Belief Propagation. In: de Sá, J.M., Alexandre, L.A., Duch, W., Mandic, D. (eds) Artificial Neural Networks – ICANN 2007. ICANN 2007. Lecture Notes in Computer Science, vol 4668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74690-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74690-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74689-8

  • Online ISBN: 978-3-540-74690-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics