In-network Sparsity-regularized Rank Minimization: Algorithms and Applications

Details In-network Sparsity-regularized Rank Minimization: Algorithms and Applications In-network Sparsity-regularized Rank Minimization: Algorithms and Applications

2012-03-07

arxiv.org/abs/1203.1570v1

Computer Science

Multiagent Systems

30 pages, submitted for publication on the IEEE Trans. Signal Process

Scientific paper

Given a limited number of entries from the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, recovery of the low-rank and sparse components is a fundamental task subsuming compressed sensing, matrix completion, and principal components pursuit. This paper develops algorithms for distributed sparsity-regularized rank minimization over networks, when the nuclear- and $\ell_1$-norm are used as surrogates to the rank and nonzero entry counts of the sought matrices, respectively. While nuclear-norm minimization has well-documented merits when centralized processing is viable, non-separability of the singular-value sum challenges its distributed minimization. To overcome this limitation, an alternative characterization of the nuclear norm is adopted which leads to a separable, yet non-convex cost minimized via the alternating-direction method of multipliers. The novel distributed iterations entail reduced-complexity per-node tasks, and affordable message passing among single-hop neighbors. Interestingly, upon convergence the distributed (non-convex) estimator provably attains the global optimum of its centralized counterpart, regardless of initialization. Several application domains are outlined to highlight the generality and impact of the proposed framework. These include unveiling traffic anomalies in backbone networks, predicting networkwide path latencies, and mapping the RF ambiance using wireless cognitive radios. Simulations with synthetic and real network data corroborate the convergence of the novel distributed algorithm, and its centralized performance guarantees.

Affiliated with

Also associated with

No associations

Rating

In-network Sparsity-regularized Rank Minimization: Algorithms and Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with In-network Sparsity-regularized Rank Minimization: Algorithms and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and In-network Sparsity-regularized Rank Minimization: Algorithms and Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-395434