Energy-saving gossip algorithm for compressed sensing in multi-agent systems

In this paper, we present a new recovery algorithm for innetwork compressed sensing from measurements acquired in multi-agent systems. Each agent has to recover a common signal taking advantage of local communication and simple computations. Such distributed problem typically incurs a high energy cost due to inter-node communications. In this paper we propose an iterative distributed algorithm to address this problem, featuring pairwise gossip communications and updates. We propose some theoretical results on its dynamics and numerical comparisons with the most recent approaches proposed in literature. The performance turns out to be competitive in terms of reconstruction accuracy, complexity, and energy consumption required for convergence.

[1]  Yonina C. Eldar,et al.  Distributed Compressed Sensing for Static and Time-Varying Networks , 2013, IEEE Transactions on Signal Processing.

[2]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[3]  G.B. Giannakis,et al.  Distributed compression-estimation using wireless sensor networks , 2006, IEEE Signal Processing Magazine.

[4]  Soummya Kar,et al.  Gossip Algorithms for Distributed Signal Processing , 2010, Proceedings of the IEEE.

[5]  Choon Yik Tang,et al.  Gossip Algorithms for Convex Consensus Optimization Over Networks , 2010, IEEE Transactions on Automatic Control.

[6]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Convex Optimization Over Random Networks , 2011, IEEE Transactions on Automatic Control.

[7]  Emmanuel J. Cand.  The Restricted Isometry Property and Its Implications for Compressed Sensing , 2008 .

[8]  Georgios B. Giannakis,et al.  Consensus-Based Distributed Support Vector Machines , 2010, J. Mach. Learn. Res..

[9]  Georgios B. Giannakis,et al.  Consensus-based distributed linear support vector machines , 2010, IPSN '10.

[10]  Enrico Magli,et al.  Distributed Iterative Thresholding for $\ell _{0}/\ell _{1}$ -Regularized Linear Inverse Problems , 2015, IEEE Transactions on Information Theory.

[11]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[12]  Béla Bollobás,et al.  Random Graphs , 1985 .

[13]  Mike E. Davies,et al.  Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.

[14]  Enrico Magli,et al.  Distributed soft thresholding for sparse signal recovery , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[15]  Rayan Saab,et al.  Sparco: A Testing Framework for Sparse Reconstruction , 2007 .

[16]  T. Blumensath,et al.  Iterative Thresholding for Sparse Approximations , 2008 .

[17]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[18]  Angelia Nedic,et al.  Distributed subgradient projection algorithm for convex optimization , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[19]  A. Nedić,et al.  Asynchronous Gossip Algorithm for Stochastic Optimization: Constant Stepsize Analysis* , 2010 .

[20]  Gonzalo Mateos,et al.  Distributed Sparse Linear Regression , 2010, IEEE Transactions on Signal Processing.

[21]  João M. F. Xavier,et al.  Distributed Basis Pursuit , 2010, IEEE Transactions on Signal Processing.

[22]  Massimo Fornasier,et al.  Theoretical Foundations and Numerical Methods for Sparse Recovery , 2010, Radon Series on Computational and Applied Mathematics.

[23]  Chiara Ravazzi,et al.  Ergodic Randomized Algorithms and Dynamics Over Networks , 2013, IEEE Transactions on Control of Network Systems.

[24]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[25]  Angelia Nedic,et al.  Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization , 2008, J. Optim. Theory Appl..

[26]  João M. F. Xavier,et al.  D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization , 2012, IEEE Transactions on Signal Processing.

[27]  Boris Polyak,et al.  Acceleration of stochastic approximation by averaging , 1992 .