On optimal quantization rules for some problems in sequential decentralized detection

  • Nguyen X
  • Wainwright M
  • Jordan M
  • 11

    Readers

    Mendeley users who have this article in their library.
  • 6

    Citations

    Citations of this article.

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 correspondence 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.

Author-supplied keywords

  • Decentralized detection
  • Decision-making under constraints
  • Experimental design
  • Hypothesis testing
  • Quantizer design
  • Sequential detection

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Xuan Long Nguyen

  • Martin J. Wainwright

  • Michael I. Jordan

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free