Distributed Hypothesis Testing: Cooperation and Concurrent Detection

DOI10.1109/TIT.2020.3019654MaRDI QIDQ5138916zbMATH OpenFDO

Authors Pierre Escamilla, Michèle Angela Wigger, Abdellatif Zaidi

Publication date 4 December 2020

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

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

zbMATH Keywords

single-sensor two-detectors system

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Statistical aspects of big data and data science (62R07) Detection theory in information and communication theory (94A13) Source coding (94A29)

Abstract: A single-sensor two-detectors system is considered where the sensor communicates with both detectors and Detector 1 communicates with Detector 2, all over noise-free rate-limited links. The sensor and both detectors observe discrete memoryless source sequences whose joint probability mass function depends on a binary hypothesis. The goal at each detector is to guess the binary hypothesis in a way that, for increasing observation lengths, the probability of error under one of the hypotheses decays to zero with largest possible exponential decay, whereas the probability of error under the other hypothesis can decay to zero arbitrarily slow. For the setting with zero-rate communication on both links, we exactly characterize the set of possible exponents and the gain brought up by cooperation, in function of the number of bits that are sent over the two links. Notice that, for this setting, tradeoffs between the exponents achieved at the two detectors arise only in few particular cases. In all other cases, each detector achieves the same performance as if it were the only detector in the system. For the setting with positive communication rates from the sensor to the detectors, we characterize the set of all possible exponents in a special case of testing against independence. In this case the cooperation link allows Detector~2 to increase its Type-II error exponent by an amount that is equal to the exponent attained at Detector 1. We also provide a general inner bound on the set of achievable error exponents. For most cases it shows a tradeoff between the two exponents.

Cited in

(5)

• Interactive Distributed Detection: Architecture and Performance Analysis
• The suboptimality of randomized tests in distributed and quantized detection systems
• Social Learning and Distributed Hypothesis Testing
• Byzantine-Resilient Distributed Hypothesis Testing With Time-Varying Network Topology
• Distributed Hypothesis Testing Based on Unequal-Error Protection Codes

This page was built for publication: Distributed Hypothesis Testing: Cooperation and Concurrent Detection

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