Asynchronous adaptive networks
arXiv:1511.09180
Abstract
In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in response to streaming data and to continually learn and adapt to track drifts in the data and models. Under reasonable technical conditions on the data, the adaptive networks were shown to be mean-square stable in the slow adaptation regime, and their mean-square-error performance and convergence rate were characterized in terms of the network topology and data statistical moments [2]. Classical results for single-agent adaptation and learning were recovered as special cases. Following the works [3]-[5], this chapter complements the exposition from [1] and extends the results to asynchronous networks. The operation of this class of networks can be subject to various sources of uncertainties that influence their dynamic behavior, including randomly changing topologies, random link failures, random data arrival times, and agents turning on and off randomly. In an asynchronous environment, agents may stop updating their solutions or may stop sending or receiving information in a random manner and without coordination with other agents. The presentation will reveal that the mean-square-error performance of asynchronous networks remains largely unaltered compared to synchronous networks. The results justify the remarkable resilience of cooperative networks in the face of random events.
arXiv commentTo appear as book chapter in the edited volume entitled Cooperative and Graph Signal Processing, P. Djuric and C. Richard, editors, Elsevier, 2018
References in corpus (23)
- The structure and function of complex networks
- Kronecker Graphs: An Approach to Modeling Networks
- Diffusion Adaptation Strategies for Distributed Optimization and Learning over Networks
- Distributing the Kalman Filter for Large-Scale Systems
- Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation over Adaptive Networks
- Distributed Learning in Wireless Sensor Networks
- Multitask Diffusion Adaptation over Networks
- Sensor Networks with Random Links: Topology Design for Distributed Consensus
- Diffusion LMS over Multitask Networks
- Convergence Rate Analysis of Distributed Gossip (Linear Parameter) Estimation: Fundamental Limits and Tradeoffs
- Sparse Distributed Learning Based on Diffusion Adaptation
- Distributed Random Projection Algorithm for Convex Optimization
- Diffusion Adaptation over Networks under Imperfect Information Exchange and Non-stationary Data
- Distributed Pareto Optimization via Diffusion Strategies
- Performance Limits for Distributed Estimation Over LMS Adaptive Networks
- Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication
- Adaptive Penalty-Based Distributed Stochastic Convex Optimization
- A Sparsity-Aware Adaptive Algorithm for Distributed Learning
- Dictionary Learning over Distributed Models
- Proximal Multitask Learning over Networks with Sparsity-inducing Coregularization
- Distributed Consensus Algorithms in Sensor Networks: Link Failures and Channel Noise
- Weight Optimization for Consensus Algorithms with Correlated Switching Topology
- Performance Limits of Stochastic Sub-Gradient Learning, Part II: Multi-Agent Case