A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

İnan, Yunus; Kayaalp, Mert; Sayed, Ali H.; Telatar, Emre

doi:10.1109/icc45855.2022.9838646

Cited by 7 publications

(7 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We show that the exponents θ 1 , θ 2 and the rates R{2},1 , R{2},2 , R{1,2},1 and R{1,2},2 satisfy constraints (32). To this end, notice that by similar arguments as in the preceding subsections:…”

Section: Converse Proof To Theoremsupporting

confidence: 58%

“…For the case 1 < 2 , "Rate-sharing" on the second link does not have any added value. However, for the case 1 > 2 , we illustrate the benefits of "Rate-sharing" on both links and the resulting tradeoff from varying the choices of the rates R {1,2},1 , R {2},1 , R {1,2},2 and R {2},2 that satisfy (32). This tradeoff stems from multiplexing three coding subschemes among which we have two full versions of the basic two-hop scheme and one degraded subscheme as explained in Subsection IV-C.…”

Section: A Numerical Simulationsmentioning

confidence: 99%

“…Above works all focused on maximum rate-constraints where the length of any message sent over the communication link is limited. In this paper, we consider expected rate-constraints as in [10], [30]- [32], where the expected length of the message sent over the communication link is constrained. Most closely related are the works in [30], [33] which showed that under an expected rate-constraint R, the optimal type-II error exponent for testing against independence in the single-sensor and single-DC setup coincides with the optimal type-II error exponent under a maximum-rate constraint R/(1 − ), for denoting the permissible type-I error constraint.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Two-Hop Network with Multiple Decision Centers under Expected-Rate Constraints

Hamad

Wigger

Sarkiss

2021

2021 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations obey some Markov chain. For this system, we characterize the fundamental type-II error exponents region, i.e., the type-II error exponents that the various DCs can achieve simultaneously, under expected rate-constraints. Our results show that this fundamental exponents region is boosted compared to the region under maximum-rate constraints, and that it depends on the permissible type-I error probabilities. When all DCs have equal permissible type-I error probabilities, the exponents region is rectangular and all DCs can simultaneously achieve their optimal type-II error exponents. When the DCs have different permissible type-I error probabilities, a tradeoff between the type-II error exponents at the different DCs arises. New achievability and converse proofs are presented. For the achievability, a new multiplexing and rate-sharing strategy is proposed. The converse proof is based on applying different change of measure arguments in parallel and on proving asymptotic Markov chains. For the special cases K = 2 and K = 3, we provide simplified expressions for the exponents region; a similar simplification is conjectured for arbitrary K ≥ 2.

show abstract

Section: Converse Proof To Theoremsupporting

confidence: 58%

Section: A Numerical Simulationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Two-Hop Network with Multiple Decision Centers under Expected-Rate Constraints

Hamad

Wigger

Sarkiss

2021

2021 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…as in (32), instead of restricting to a single rate choice for the communication on the first link R {1,2},1 = R 1 /(1 − 1 ). For the case 1 < 2 , "Rate-sharing" on the second link does not have any added value.…”

Section: A Numerical Simulationsmentioning

confidence: 99%

“…) Above works all focused on maximum rate-constraints where the length of any message sent over the communication link is limited. In this paper, we consider expected rateconstraints as in [10], [30]- [32], where the expected length of the message sent over the communication link is constrained. Most closely related are the works in [30], [33] which showed that under an expected rate-constraint R, the optimal type-II error exponent for testing against independence in the singlesensor and single-DC setup coincides with the optimal type-II error exponent under a maximum-rate constraint R/(1 − ), for denoting the permissible type-I error constraint.…”

Section: Introductionmentioning

confidence: 99%

Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints

Hamad

Wigger

Sarkiss

2023

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

We consider a multi-hop distributed hypothesis testing problem with multiple decision centers (DCs) for testing against independence and where the observations obey some Markov chain. For this system, we characterize the fundamental type-II error exponents region, i.e., the type-II error exponents that the various DCs can achieve simultaneously, under expected rate-constraints. Our results show that this fundamental exponents region is boosted compared to the region under maximumrate constraints, and that it depends on the permissible type-I error probabilities. When all DCs have equal permissible type-I error probabilities, the exponents region is rectangular and all DCs can simultaneously achieve their optimal type-II error exponents. When the DCs have different permissible type-I error probabilities, a tradeoff between the type-II error exponents at the different DCs arises. New achievability and converse proofs are presented. For the achievability, a new multiplexing and rate-sharing strategy is proposed. The converse proof is based on applying different change of measure arguments in parallel and on proving asymptotic Markov chains. For the special cases K ∈ {2, 3}, and for arbitrary K ≥ 2 when all permissible type-I error probabilities at the various DCs are equal, we provide simplified expressions for the exponents region; a similar simplification is conjectured for the general case.

show abstract