mlsanityData to 14 Oct 2026

Study of Robust Diffusion Recursive Least Squares Algorithms with Side Information for Networked Agents

arXiv 1812.09985 ↗First posted 24 Dec 2018cs.IT cs.LG eess.SPcited by 10

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Dec 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 4; 2023: 0; 2024: 0; 2025: 1.

10 papers.