On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection

From MaRDI portal
Publication:3604459

DOI10.1109/TIT.2008.924647zbMATH Open1328.94025arXivmath/0608556OpenAlexW2096565262MaRDI QIDQ3604459FDOQ3604459

Martin J. Wainwright, Xuanlong Nguyen, Michael Jordan

Publication date: 24 February 2009

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

Abstract: We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a global decision function (a choice between two competing hypotheses), and a set of quantization rules (the local decisions on the basis of which the global decision is made). This paper addresses an open problem of whether in the Bayesian formulation of sequential decentralized detection, optimal local decision functions can be found within the class of stationary rules. We develop an asymptotic approximation to the optimal cost of stationary quantization rules and exploit this approximation to show that stationary quantizers are not optimal in a broad class of settings. We also consider the class of blockwise stationary quantizers, and show that asymptotically optimal quantizers are likelihood-based threshold rules.


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




Recommendations




Cited In (5)





This page was built for publication: On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection

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