Study of Robust Diffusion Recursive Least Squares Algorithms with Side Information for Networked Agents
arXiv:1812.09985 · doi:10.1109/TSP.2019.2893846
Abstract
This work develops a robust diffusion recursive least squares algorithm to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. This algorithm minimizes an exponentially weighted least-squares cost function subject to a time-dependent constraint on the squared norm of the intermediate estimate update at each node. With the help of side information, the constraint is recursively updated in a diffusion strategy. Moreover, a control strategy for resetting the constraint is also proposed to retain good tracking capability when the estimated parameters suddenly change. Simulations show the superiority of the proposed algorithm over previously reported techniques in various impulsive noise scenarios.
6 pages, 4 figures
References in corpus (4)
- Diffusion Adaptation Strategies for Distributed Optimization and Learning over Networks
- Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation over Adaptive Networks
- Distributed Pareto Optimization via Diffusion Strategies
- Diffusion Least Mean P-Power Algorithms for Distributed Estimation in Alpha-Stable Noise Environments
Cited by in corpus (8)
- Robust Aggregation for Federated Learning
- Convergence of a Distributed Least Squares
- Energy-Efficient Distributed Learning Algorithms for Coarsely Quantized Signals
- Transient Theoretical Analysis of Diffusion RLS Algorithm for Cyclostationary Colored Inputs
- Robust DCD-Based Recursive Adaptive Algorithms
- Study of Energy-Efficient Distributed RLS-based Learning with Coarsely Quantized Signals
- Study of Robust Adaptive Beamforming Based on Low-Complexity DFT Spatial Sampling
- Robust Adaptive Filtering Based on Exponential Functional Link Network