Distributed Sequential Detection for Gaussian Shift-in-Mean Hypothesis Testing
Anit Kumar Sahu, Soummya Kar

TL;DR
This paper introduces a distributed sequential hypothesis testing algorithm for Gaussian mean shifts, combining consensus and innovations, with performance guarantees and asymptotic optimality in multi-agent networks.
Contribution
A novel distributed SPRT-based algorithm for Gaussian shift-in-mean testing that achieves desired error rates and approaches centralized optimality asymptotically.
Findings
Algorithm achieves specified error probabilities with finite-time termination.
Asymptotic exponents approach centralized detector performance.
Expected stopping times depend on network connectivity.
Abstract
This paper studies the problem of sequential Gaussian shift-in-mean hypothesis testing in a distributed multi-agent network. A sequential probability ratio test (SPRT) type algorithm in a distributed framework of the \emph{consensus}+\emph{innovations} form is proposed, in which the agents update their decision statistics by simultaneously processing latest observations (innovations) sensed sequentially over time and information obtained from neighboring agents (consensus). For each pre-specified set of type I and type II error probabilities, local decision parameters are derived which ensure that the algorithm achieves the desired error performance and terminates in finite time almost surely (a.s.) at each network agent. Large deviation exponents for the tail probabilities of the agent stopping time distributions are obtained and it is shown that asymptotically (in the number of agents…
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.
