[论文解读] Asymptotic Performance of Adaptive Distributed Detection over Networks.

Paolo Braca, Stefano Maranò+2 more|arXiv (Cornell University)|Jan 22, 2014

Distributed Sensor Networks and Detection Algorithms被引用 9

一句话总结

本文研究了在去中心化网络中使用恒定步长的自适应分布式检测，以实现持续学习与跟踪。研究证明检测误差概率随 1/μ 呈指数衰减，且误差指数随代理数量线性增长，与集中式随机梯度性能一致。

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 probabilities of miss-detection and false-alarm, when the agents interact with each other according to distributed strategies that employ 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 from these expressions. 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 exponents governing the decay 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.

研究动机与目标

• 理解去中心化检测网络中协作与自适应之间的相互作用。
• 表征在恒定步长下分布式检测的渐近性能，以实现持续学习。
• 推导大规模网络中虚警概率和漏检概率的尺度律。
• 将分布式检测性能与集中式随机梯度解进行比较。

提出的方法

• 各代理使用具有恒定步长的分布式策略，以实现对流式数据的持续自适应与学习。
• 在所提策略下，各代理的协作过程收敛至稳态分布。
• 应用大偏差分析，推导出虚警概率与漏检概率衰减速率的闭式表达式。
• 在慢适应区域（小 μ）下，确立了稳态分布的渐近高斯性。
• 分析将检测误差的尺度与估计误差的尺度进行比较，揭示出不同行为：检测误差呈指数衰减，而估计误差呈线性衰减。

实验结果

研究问题

• RQ1 协作与自适应如何共同影响去中心化网络中的检测性能？
• RQ2 在恒定步长下，检测误差概率的渐近行为如何？
• RQ3 误差指数如何随代理数量和步长 μ 变化？
• RQ4 分布式检测性能与集中式随机梯度检测相比如何？
• RQ5 为何检测误差与估计误差对 μ 的依赖关系不同？

主要发现

• 各代理的协作检测过程输出收敛至稳态分布。
• 在慢适应区域（小 μ）下，稳态分布渐近服从高斯分布。
• 虚警概率与漏检概率随 1/μ 呈指数衰减，衰减速率随代理数量线性增加。
• 检测误差指数的尺度为 O(1/μ)，而估计误差指数的尺度为 O(μ)，揭示了其根本不同的尺度行为。
• 协作策略使每个代理能够达到与集中式随机梯度解相同的检测误差指数。