Bounds and estimates for BP convergence on binary undirected graphical models
published: Feb. 25, 2007, recorded: January 2005, views: 4402
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Belief Propagation (BP) has become a popular method for inference on graphical models. Accurate approximations for intractable quantities (e.g. single-node marginals) can be obtained within rather modest computation times. However, for large interaction strengths (i.e. potentials that are highly dependent on their arguments) or densely connected graphs, BP can fail to converge. This can be remedied by damping the iteration equations, using sequential update schemes or using entirely different algorithms such as double-loop algorithms, that directly minimize the Bethe free energy. However, the value of this approach is questionable, since there is empirical evidence that failure of convergence of BP often indicates low quality of the Bethe approximation.
Download slides: oiml05_joris_becbu_01.pdf (89.2 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !
Write your own review or comment: