Passing And Bouncing Messages For Generalized Inference
Yee Whye, Teh Max · 2001
Inference on general loopy graphs is a NP hard problem. Many approximate methods, like Monte carlo sampling and variational approximations have become available over the last decades, each with its own advantages and disadvantages. However, when the graphical structure is a tree, there is an algorithm for doing inference that is only linear in the number