Diffusion-Based Adaptive Distributed Detection: Steady-State Performance in the Slow Adaptation Regime

DOI10.1109/TIT.2016.2580665MaRDI QIDQ2976683zbMATH OpenOpenAlexFDO

Authors Vincenzo Matta, Paolo Braca, Stefano Marano, Ali H. Sayed

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.5742

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Abstract: This work examines the close interplay between cooperation and adaptation for distributed detection schemes over fully decentralized networks. The combined attributes of cooperation and adaptation are necessary to enable networks of detectors to continually learn from streaming data and to continually track drifts in the state of nature when deciding in favor of one hypothesis or another. The results in the paper establish a fundamental scaling law for the steady-state probabilities of miss-detection and false-alarm in the slow adaptation regime, when the agents interact with each other according to distributed strategies that employ small constant step-sizes. The latter are critical to enable continuous adaptation and learning. The work establishes three key results. First, it is shown that the output of the collaborative process at each agent has a steady-state distribution. Second, it is shown that this distribution is asymptotically Gaussian in the slow adaptation regime of small step-sizes. And third, by carrying out a detailed large deviations analysis, closed-form expressions are derived for the decaying rates of the false-alarm and miss-detection probabilities. Interesting insights are gained. In particular, it is verified that as the step-size $mu$ decreases, the error probabilities are driven to zero exponentially fast as functions of $1/mu$, and that the error exponents increase linearly in the number of agents. It is also verified that the scaling laws governing errors of detection and errors of estimation over networks behave very differently, with the former having an exponential decay proportional to $1/mu$, while the latter scales linearly with decay proportional to $mu$. It is shown that the cooperative strategy allows each agent to reach the same detection performance, in terms of detection error exponents, of a centralized stochastic-gradient solution.

Recommendations

• Distributed Detection Over Adaptive Networks Using Diffusion Adaptation
• Node-Specific Diffusion LMS-Based Distributed Detection Over Adaptive Networks
• Distributed Detection With Adaptive Topology and Nonideal Communication Channels
• Analysis of Distributed Adaptive Filters Based on Diffusion Strategies Over Sensor Networks
• Adaptive Distributed Estimation Based on Recursive Least-Squares and Partial Diffusion
• Diffusion Strategies Outperform Consensus Strategies for Distributed Estimation Over Adaptive Networks
• Diffusion Adaptation Strategies for Distributed Estimation Over Gaussian Markov Random Fields
• Diffusion recursive least-squares for distributed estimation over adaptive networks
• Distributed Detection in Ad Hoc Networks Through Quantized Consensus
• Adaptive Robust Distributed Learning in Diffusion Sensor Networks

Cited in

(2)

• Nonlinear Consensus+Innovations under Correlated Heavy-Tailed Noises: Mean Square Convergence Rate and Asymptotics
• Distributed Recursive Estimation under Heavy-Tail Communication Noise

This page was built for publication: Diffusion-Based Adaptive Distributed Detection: Steady-State Performance in the Slow Adaptation Regime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976683)