Distributed Message Passing for Large Scale Graphical Models
In this paper, the authors propose a distributed message-passing algorithm for inference in large scale graphical models. Their method can handle large problems efficiently by distributing and parallelizing the computation and memory requirements. The convergence and optimality guarantees of recently developed message-passing algorithms are preserved by introducing new types of consistency messages, sent between the distributed computers. They demonstrate the effectiveness of their approach in the task of stereo reconstruction from high-resolution imagery, and show that inference is possible with more than 200 labels in images larger than 10 MPixels.