Robust Probabilistic Inference in Distributed Systems

by   Mark Paskin, et al.

Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a natural fit for distributed systems, but they must be robust to the failure situations that arise in real-world settings, such as unreliable communication and node failures. Unfortunately, the popular sum-product algorithm can yield very poor estimates in these settings because the nodes' beliefs before convergence can be arbitrarily different from the correct posteriors. In this paper, we present a new message passing algorithm for probabilistic inference which provides several crucial guarantees that the standard sum-product algorithm does not. Not only does it converge to the correct posteriors, but it is also guaranteed to yield a principled approximation at any point before convergence. In addition, the computational complexity of the message passing updates depends only upon the model, and is dependent of the network topology of the distributed system. We demonstrate the approach with detailed experimental results on a distributed sensor calibration task using data from an actual sensor network deployment.



There are no comments yet.


page 1

page 2


Message-Passing Algorithms: Reparameterizations and Splittings

The max-product algorithm, a local message-passing scheme that attempts ...

Convergent message passing algorithms - a unifying view

Message-passing algorithms have emerged as powerful techniques for appro...

Message passing for probabilistic models on networks with loops

In this paper, we extend a recently proposed framework for message passi...

Distributed Regression in Sensor Networks: Training Distributively with Alternating Projections

Wireless sensor networks (WSNs) have attracted considerable attention in...

MS2MP: A Min-Sum Message Passing Algorithm for Motion Planning

Gaussian Process (GP) formulation of continuoustime trajectory offers a ...

Distributed Approximation Algorithms for the Combinatorial Motion Planning Problem

We present a new 4-approximation algorithm for the Combinatorial Motion ...

MP net as Abstract Model of Communication for Message-passing Applications

MP net is a formal model specifically designed for the field of parallel...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.