Talk:Belief propagation

message: The use of factor graphs in the description of the algorithm seems weaker than the approach taken by Yedidia et al in .  At least the one taken here is less clear.
:In fact, factor graphs are more general than pairwise Markov random fields, the model used by Yedidia in the technical report to which you make reference.  For instance, see a more recent technical report by Yedidia et al. in .  It's also not hard to see how belief propagation in the pairwise MRF setting can be converted to BP in the factor graph setting. Ikcotyck 01:50, 26 July 2005 (UTC)
replies: text: Hmm..  That's the article I know as well, I can't remember why I put 1986. Ikcotyck
There is a reference to the "diameter of the tree" in the general graphs section which doesn't help since it doesn't mention trees. maddanio
It is mentioned that Belief Propagation and Sum-Product are equivalent. This is wrong! What is true is that BP can be formulated as a special case of SP. Please consult Bishop in Pattern Recognition Machine learning, page 403. Gugux (talk) 00:08, 12 March 2008 (UTC)

message: I removed this article from the computer vision category.  BP is probably not unrelated to CV but
# It is not a methodology developed within CV or specific to CV
# There is no material in this article which relates it to CV.
--KYN 22:15, 27 July 2007 (UTC)
replies: text: That's true.  Perhaps I can work in some computer vision-related material... Iknowyourider (t c) 23:26, 27 July 2007 (UTC)
thread_title:  Computer vision category 

message: Could someone explain what the word "belief" refers to in this context?
Gwideman (talk) 11:14, 12 April 2009 (UTC)
replies: text: I assume it refers to the subjectivist school of probability of using probability theory to describe a state of knowledge (the "degree of belief"). —3mta3 (talk) 10:37, 2 May 2009 (UTC)
thread_title:  "Belief"? 

message: The article currently states that BP is a special case of the sum-product algorithm (and refers to an article which makes the same assertion). What other cases are there? Is the max-product algorithm for finding maximum a posteriori estimates also considered a type of BP? —3mta3 (talk) 10:42, 2 May 2009 (UTC)
replies: text: A previous commenter referred to Bishop, p 403. Luckily this chapter is available on line. He also asserts that it is a special case (but again, without saying why). —3mta3 (talk) 10:49, 2 May 2009 (UTC)
thread_title:  special case? 

message: It seems strange to me that Belief Propagation would be used to only refer to the Sum-Product Belief Propagation. The Max-Product Belief Propagation has been quite studied too (and a google scholar search shows that the term "Max-Product Belief Propagation" is actually commonly used by researchers in the Graphical Model field). Furthermore it seems to me Belief Propagation is supposed to work for any semiring. If this is not controversial, I would like to refactor a bit the article to emphasize that Belief Propagation can be used with different semirings, and that the Sum-Product and Max-Product semirings are the most commonly used. This would also make the section about Viterbi more relevant, and would hopefully make everything easier to understand by showing the parallelism with the classic Hidden Markov Model algorithms (Sum-Product BP essentially reduces to the Forward-Backward algorithm in a HMM, and Max-Product BP reduces to the Viterbi algorithm).  — Preceding unsigned comment added by Tokidokix (talk • contribs) 07:54, 8 August 2013 (UTC)
thread_title:  Max-product Belief Propagation 

message: I think that it's more correct  — Preceding unsigned comment added by 2001:BF8:200:FF70:B89D:1E76:B49A:A3B2 (talk) 15:41, 26 November 2013 (UTC)
thread_title:  Write "1" instead of the "Uniform distribution" 

message: Why Judea Pearl in 1982? This was proposed by Gallager, 1963! See "Bounds on the Performance of Belief Propagation Decoding" by David Burshtein and Gadi Miller, http://www.josephboutros.org/ldpc_vs_turbo/ldpc_Burshtein_Miller_IT02.pdf. I understand, Pearl proposed the name "Belief_propagation" only ≈≈≈≈  — Preceding unsigned comment added by 188.254.126.223 (talk) 10:34, 6 April 2018 (UTC)
replies: text: Agreed!! Gallager's algorithm also was in the general context of loopy graphs 2A01:CB00:35:C000:6D81:7F0C:15E0:A595 (talk) 21:22, 11 July 2023 (UTC)
thread_title:  Gallager, 1963!