Distributed Chernoff Test: Optimal decision systems over networks
Anshuka Rangi, Massimo Franceschetti, Stefano Marano

TL;DR
This paper introduces distributed and centralized adaptive hypothesis tests based on Chernoff's framework, achieving asymptotic optimality in decision risk and communication efficiency over sensor networks.
Contribution
It extends the classic Chernoff test to network settings with and without a fusion center, ensuring asymptotic optimality and communication efficiency in distributed decision making.
Findings
Achieves asymptotic optimality in risk minimization.
Maintains low communication costs per network node.
Extends analysis to quantized messages and unreliable channels.
Abstract
We study "active" decision making over sensor networks where the sensors' sequential probing actions are actively chosen by continuously learning from past observations. We consider two network settings: with and without central coordination. In the first case, the network nodes interact with each other through a central entity, which plays the role of a fusion center. In the second case, the network nodes interact in a fully distributed fashion. In both of these scenarios, we propose sequential and adaptive hypothesis tests extending the classic Chernoff test. We compare the performance of the proposed tests to the optimal sequential test. In the presence of a fusion center, our test achieves the same asymptotic optimality of the Chernoff test, minimizing the risk, expressed by the expected cost required to reach a decision plus the expected cost of making a wrong decision, when the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
