Improved Random-Binning Exponent for Distributed Hypothesis Testing

06/26/2023

∙

Shimokawa, Han, and Amari proposed a "quantization and binning" scheme for distributed binary hypothesis testing. We propose a simple improvement on the receiver's guessing rule in this scheme. This attains a better exponent of the error probability of the second type.

READ FULL TEXT

Improved Random-Binning Exponent for Distributed Hypothesis Testing

On Sub-optimality of Random Binning for Distributed Hypothesis Testing

On Hypothesis Testing via a Tunable Loss

Distributed Hypothesis Testing with Privacy Constraints

An Information-Spectrum Approach to Distributed Hypothesis Testing for General Sources

Hypothesis Testing of Mixture Distributions using Compressed Data

Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents

On Minimax Detection of Gaussian Stochastic Sequences with Imprecisely Known Means and Covariance Matrices

Improved Random-Binning Exponent for Distributed Hypothesis Testing

Related Research

On Sub-optimality of Random Binning for Distributed Hypothesis Testing

On Hypothesis Testing via a Tunable Loss

Distributed Hypothesis Testing with Privacy Constraints

An Information-Spectrum Approach to Distributed Hypothesis Testing for General Sources

Hypothesis Testing of Mixture Distributions using Compressed Data

Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents

On Minimax Detection of Gaussian Stochastic Sequences with Imprecisely Known Means and Covariance Matrices