On Sub-optimality of Random Binning for Distributed Hypothesis Testing

01/31/2022
by   Shun Watanabe, et al.
0

We investigate the quantize and binning scheme, known as the Shimokawa-Han-Amari (SHA) scheme, for the distributed hypothesis testing. We develop tools to evaluate the critical rate attainable by the SHA scheme. For a product of binary symmetric double sources, we present a sequential scheme that improves upon the SHA scheme.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2023

Improved Random-Binning Exponent for Distributed Hypothesis Testing

Shimokawa, Han, and Amari proposed a "quantization and binning" scheme f...
research
02/01/2018

Robust Sequential Detection in Distributed Sensor Networks

We consider the problem of sequential binary hypothesis testing with a d...
research
09/17/2023

ChainForge: A Visual Toolkit for Prompt Engineering and LLM Hypothesis Testing

Evaluating outputs of large language models (LLMs) is challenging, requi...
research
11/02/2021

Detecting Whether a Stochastic Process is Finitely Expressed in a Basis

Is it possible to detect if the sample paths of a stochastic process alm...
research
06/13/2012

CT-NOR: Representing and Reasoning About Events in Continuous Time

We present a generative model for representing and reasoning about the r...
research
07/18/2022

The Vocal Signature of Social Anxiety: Exploration using Hypothesis-Testing and Machine-Learning Approaches

Background - Social anxiety (SA) is a common and debilitating condition,...
research
05/10/2023

Pearson-Matthews correlation coefficients for binary and multinary classification and hypothesis testing

The Pearson-Matthews correlation coefficient (usually abbreviated MCC) i...

Please sign up or login with your details

Forgot password? Click here to reset