Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network

Daming Cao; Lin Zhou; Vincent Y.F. Tan

doi:10.1109/ISIT.2019.8849768

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network

Daming Cao
, Lin Zhou
, Vincent Y.F. Tan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

By proving a strong converse, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop network with communication constraints. Our proof follows by judiciously combining two recently proposed techniques for proving strong converse theorems, namely the strong converse technique via reverse hypercontractivity by Liu, van Handel, and Verdú (2017) and the strong converse technique by Tyagi and Watanabe (2018), in which the authors used a change-of-measure technique and replaced hard Markov constraints with soft information costs. The techniques used in our paper can also be applied to prove strong converse theorems for other multiterminal hypothesis testing against independence problems.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1994-1998
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849768
State	Published - Jul 2019
Externally published	Yes
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July
ISSN (Print)	2157-8095

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

Keywords

Hypothesis testing with communication constraints
Relay
Strong converse
Testing against independence
Two-hop network

Access to Document

10.1109/ISIT.2019.8849768

Cite this

Cao, D., Zhou, L., & Tan, V. Y. F. (2019). Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 1994-1998). Article 8849768 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849768

@inproceedings{f9a1d727b2cd42768a713f5dedeafc98,

title = "Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network",

abstract = "By proving a strong converse, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop network with communication constraints. Our proof follows by judiciously combining two recently proposed techniques for proving strong converse theorems, namely the strong converse technique via reverse hypercontractivity by Liu, van Handel, and Verd{\'u} (2017) and the strong converse technique by Tyagi and Watanabe (2018), in which the authors used a change-of-measure technique and replaced hard Markov constraints with soft information costs. The techniques used in our paper can also be applied to prove strong converse theorems for other multiterminal hypothesis testing against independence problems.",

keywords = "Hypothesis testing with communication constraints, Relay, Strong converse, Testing against independence, Two-hop network",

author = "Daming Cao and Lin Zhou and Tan, \{Vincent Y.F.\}",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849768",

language = "英语",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1994--1998",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

address = "美国",

}

Cao, D, Zhou, L & Tan, VYF 2019, Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849768, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 1994-1998, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849768

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network. / Cao, Daming; Zhou, Lin; Tan, Vincent Y.F.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 1994-1998 8849768 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network

AU - Cao, Daming

AU - Zhou, Lin

AU - Tan, Vincent Y.F.

PY - 2019/7

Y1 - 2019/7

N2 - By proving a strong converse, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop network with communication constraints. Our proof follows by judiciously combining two recently proposed techniques for proving strong converse theorems, namely the strong converse technique via reverse hypercontractivity by Liu, van Handel, and Verdú (2017) and the strong converse technique by Tyagi and Watanabe (2018), in which the authors used a change-of-measure technique and replaced hard Markov constraints with soft information costs. The techniques used in our paper can also be applied to prove strong converse theorems for other multiterminal hypothesis testing against independence problems.

AB - By proving a strong converse, we strengthen the weak converse result by Salehkalaibar, Wigger and Wang (2017) concerning hypothesis testing against independence over a two-hop network with communication constraints. Our proof follows by judiciously combining two recently proposed techniques for proving strong converse theorems, namely the strong converse technique via reverse hypercontractivity by Liu, van Handel, and Verdú (2017) and the strong converse technique by Tyagi and Watanabe (2018), in which the authors used a change-of-measure technique and replaced hard Markov constraints with soft information costs. The techniques used in our paper can also be applied to prove strong converse theorems for other multiterminal hypothesis testing against independence problems.

KW - Hypothesis testing with communication constraints

KW - Relay

KW - Strong converse

KW - Testing against independence

KW - Two-hop network

UR - https://www.scopus.com/pages/publications/85073166169

U2 - 10.1109/ISIT.2019.8849768

DO - 10.1109/ISIT.2019.8849768

M3 - 会议稿件

AN - SCOPUS:85073166169

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1994

EP - 1998

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Cao D, Zhou L, Tan VYF. Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 1994-1998. 8849768. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2019.8849768

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this