pith. sign in

arxiv: 1301.2130 · v2 · pith:JZYLR5RBnew · submitted 2013-01-10 · 💻 cs.IT · cs.DC· math.IT· math.OC

Distributed soft thresholding for sparse signal recovery

classification 💻 cs.IT cs.DCmath.ITmath.OC
keywords distributedsoftthresholdingcommunicationdistarecoverysparsestep
0
0 comments X
read the original abstract

In this paper, we address the problem of distributed sparse recovery of signals acquired via compressed measurements in a sensor network. We propose a new class of distributed algorithms to solve Lasso regression problems, when the communication to a fusion center is not possible, e.g., due to communication cost or privacy reasons. More precisely, we introduce a distributed iterative soft thresholding algorithm (DISTA) that consists of three steps: an averaging step, a gradient step, and a soft thresholding operation. We prove the convergence of DISTA in networks represented by regular graphs, and we compare it with existing methods in terms of performance, memory, and complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.