Non Parametric Distributed Inference in Sensor Networks Using Box Particles Messages

This paper deals with the problem of inference in distributed systems where the probability model is stored in a distributed fashion. Graphical models provide powerful tools for modeling this kind of problems. Inspired by the box particle filter which combines interval analysis with particle filtering to solve temporal inference problems, this paper introduces a belief propagation-like message-passing algorithm that uses bounded error methods to solve the inference problem defined on an arbitrary graphical model. We show the theoretic derivation of the novel algorithm and we test its performance on the problem of calibration in wireless sensor networks. That is the positioning of a number of randomly deployed sensors, according to some reference defined by a set of anchor nodes for which the positions are known a priori. The new algorithm, while achieving a better or similar performance, offers impressive reduction of the information circulating in the network and the needed computation times

Reason Maintenance - State of the Art

This paper describes state of the art in reason maintenance with a focus on its future usage in the KiWi project. To give a bigger picture of the field, it also mentions closely related issues such as non-monotonic logic and paraconsistency. The paper is organized as follows: first, two motivating scenarios referring to semantic wikis are presented which are then used to introduce the different reason maintenance techniques

Energy Norms and the Stability of the Einstein Evolution Equations

The Einstein evolution equations may be written in a variety of equivalent analytical forms, but numerical solutions of these different formulations display a wide range of growth rates for constraint violations. For symmetric hyperbolic formulations of the equations, an exact expression for the growth rate is derived using an energy norm. This expression agrees with the growth rate determined by numerical solution of the equations. An approximate method for estimating the growth rate is also derived. This estimate can be evaluated algebraically from the initial data, and is shown to exhibit qualitatively the same dependence as the numerically-determined rate on the parameters that specify the formulation of the equations. This simple rate estimate therefore provides a useful tool for finding the most well-behaved forms of the evolution equations.Comment: Corrected typos; to appear in Physical Review

Merging Belief Propagation and the Mean Field Approximation: A Free Energy Approach

We present a joint message passing approach that combines belief propagation and the mean field approximation. Our analysis is based on the region-based free energy approximation method proposed by Yedidia et al. We show that the message passing fixed-point equations obtained with this combination correspond to stationary points of a constrained region-based free energy approximation. Moreover, we present a convergent implementation of these message passing fixedpoint equations provided that the underlying factor graph fulfills certain technical conditions. In addition, we show how to include hard constraints in the part of the factor graph corresponding to belief propagation. Finally, we demonstrate an application of our method to iterative channel estimation and decoding in an orthogonal frequency division multiplexing (OFDM) system

The Velocity of the Propagating Wave for General Coupled Scalar Systems

We consider spatially coupled systems governed by a set of scalar density evolution equations. Such equations track the behavior of message-passing algorithms used, for example, in coding, sparse sensing, or constraint-satisfaction problems. Assuming that the "profile" describing the average state of the algorithm exhibits a solitonic wave-like behavior after initial transient iterations, we derive a formula for the propagation velocity of the wave. We illustrate the formula with two applications, namely Generalized LDPC codes and compressive sensing.Comment: 5 pages, 5 figures, submitted to the Information Theory Workshop (ITW) 2016 in Cambridge, U