{'fraction_non_alphanumeric': 0.029826014913007456, 'fraction_numerical': 0.013256006628003313, 'mean_word_length': 5.459893048128342, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Robust Distributed Estimation by Networked Agents

Diffusion adaptive networks tasked with solving estimation problems have attracted attention in recent years due to their reliability, scalability, resource efficiency, and resilience to node and link failure. Diffusion adaptation strategies that are based on the least-mean-squares algorithm can be nonrobust against impulsive noise corrupting the measurements. Impulsive noise can degrade stability and steady-state performance, leading to unreliable estimates. In previous work [“Robust adaptation in impulsive noise,” IEEE Trans. Signal Process., vol. 64, no. 11, pp. 2851–2865, Jun. 2016], a robust adaptive algorithm for stand-alone agents was developed, one that semi-parametrically estimates the optimal error nonlinearity jointly with the parameter of interest. Prior knowledge of the impulsive noise distribution was not assumed. In this paper, we extend the framework to solve the problem of robust distributed estimation by a network of agents. Challenges arise due to the coupling among the agents and the distributed nature of the problem. The resulting diffusion strategy is analyzed and its performance illustrated by numerical simulations.