On optimal quantization rules for some problems in sequential decentralized detection
<|reference_start|>On optimal quantization rules for some problems in sequential decentralized detection: 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.<|reference_end|>
@article{nguyen2006on,
    title={On optimal quantization rules for some problems in sequential
  decentralized detection},
    author={XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan},
    journal={arXiv preprint arXiv:math/0608556},
    year={2006},
    doi={10.1109/TIT.2008.924647},
    archivePrefix={arXiv},
    eprint={math/0608556},
    primaryClass={math.ST cs.IT math.IT stat.TH}
}