Recursive Distributed Detection for Composite Hypothesis Testing: Nonlinear Observation Models in Additive Gaussian Noise
Anit Kumar Sahu, Soummya Kar

TL;DR
This paper introduces recursive distributed algorithms for composite hypothesis testing in networks with nonlinear Gaussian observations, providing theoretical guarantees for error decay under broad conditions.
Contribution
It proposes two novel consensus+innovations algorithms, IGLRT-L and IGLRT-NL, for distributed parameter estimation and hypothesis testing with nonlinear models.
Findings
Algorithms achieve asymptotic error probability decay.
Error bounds are established for linear models.
Conditions for global observability are identified.
Abstract
This paper studies recursive composite hypothesis testing in a network of sparsely connected agents. The network objective is to test a simple null hypothesis against a composite alternative concerning the state of the field, modeled as a vector of (continuous) unknown parameters determining the parametric family of probability measures induced on the agents' observation spaces under the hypotheses. Specifically, under the alternative hypothesis, each agent sequentially observes an independent and identically distributed time-series consisting of a (nonlinear) function of the true but unknown parameter corrupted by Gaussian noise, whereas, under the null, they obtain noise only. Two distributed recursive generalized likelihood ratio test type algorithms of the \emph{consensus+innovations} form are proposed, namely and , in which the 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.
