A Sparsity-Aware Adaptive Algorithm for Distributed Learning

Abstract

In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed convex set, known as property set, is constructed based on the received measurements; this defines the region in which the solution is searched for. In this paper, the property sets take the form of hyperslabs. The goal is to find a point that belongs to the intersection of these hyperslabs. To this end, sparsity encouraging variable metric projections onto the hyperslabs have been adopted. Moreover, sparsity is also imposed by employing variable metric projections onto weighted ${\ell }_1$ balls. A combine adapt cooperation strategy is adopted. Under some mild assumptions, the scheme enjoys monotonicity, asymptotic optimality and strong convergence to a point that lies in the consensus subspace. Finally, numerical examples verify the validity of the proposed scheme, compared to other algorithms, which have been developed in the context of sparse adaptive learning.

References in corpus (2)

• Distributed Basis Pursuit
• The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning

Cited by in corpus (28)

• Multitask Diffusion Adaptation over Networks
• Diffusion LMS over Multitask Networks
• Sparse Distributed Learning Based on Diffusion Adaptation
• Adaptive Least Mean Squares Estimation of Graph Signals
• Recursive Recovery of Sparse Signal Sequences from Compressive Measurements: A Review
• In-network Sparsity-regularized Rank Minimization: Algorithms and Applications
• Convergence Rates of Distributed Nesterov-like Gradient Methods on Random Networks
• Distributed Decision-Making over Adaptive Networks
• On reducing the communication cost of the diffusion LMS algorithm
• Adaptive Diffusion Schemes for Heterogeneous Networks
• Diffusion Adaptation Strategies for Distributed Estimation over Gaussian Markov Random Fields
• Decentralized Sparse Multitask RLS over Networks
• Application of Compressive Sensing Techniques in Distributed Sensor Networks: A Survey
• Coordinate-Descent Diffusion Learning by Networked Agents
• Greedy Sparsity-Promoting Algorithms for Distributed Learning
• Exact Diffusion for Distributed Optimization and Learning --- Part I: Algorithm Development
• An Online Parallel and Distributed Algorithm for Recursive Estimation of Sparse Signals
• Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization
• Exact Diffusion for Distributed Optimization and Learning --- Part II: Convergence Analysis
• Asynchronous adaptive networks
• Performance Limits of Stochastic Sub-Gradient Learning, Part II: Multi-Agent Case
• Locally Convex Sparse Learning over Networks
• Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces
• Distributed Estimation for Adaptive Networks Based on Serial-Inspired Diffusion
• Low-Complexity Set-Membership Normalized LMS Algorithm for Sparse System Modeling
• Study of Distributed Spectrum Estimation Using Alternating Mixed Discrete-Continuous Adaptation
• Sparse Diffusion Steepest-Descent for One Bit Compressed Sensing in Wireless Sensor Networks
• Distributed Compressed Estimation for Wireless Sensor Networks Based on Compressive Sensing