Splash Belief Propagation: Efficient Parallelization Through Asynchronous Scheduling
published: Jan. 19, 2010, recorded: December 2009, views: 349
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.
In this work we focus on approximate parallel inference in loopy graphical models using loopy belief propagation. We demonstrate that the natural, fully synchronous parallelization of belief propagation is highly inefficient. By bounding the achievable parallel performance of loopy belief propagation on chain graphical models we develop a theoretical understanding of the parallel limitations of belief propagation. We then introduce Splash belief propagation, a parallel asynchronous approach which achieves the optimal bounds and demonstrates linear to super-linear scaling on large graphical models. Finally we discuss how these ideas may be generalized to parallel iterative graph algorithms in the context of our new GraphLab framework.
Download slides: nipsworkshops09_gonzalez_sbpe_01-1.pdf (1.3 MB)
Download slides: nipsworkshops09_gonzalez_sbpe_01.ppt (6.6 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !