English
Related papers

Related papers: Optimal Exponents In Cascaded Hypothesis Testing u…

200 papers

A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) error. In this context, the exponential rate of convergence of…

Information Theory · Computer Science 2021-11-29 Sebastian Espinosa , Jorge F. Silva , Pablo Piantanida

In certain applications, relay terminals can be employed to simultaneously deliver information and energy to a designated receiver and a radio frequency (RF) energy harvester, respectively. In such scenarios, the relay that is preferable…

Information Theory · Computer Science 2015-01-06 Diomidis S. Michalopoulos , Himal A. Suraweera , Robert Schober

A detection system with a single sensor and $\mathsf{K}$ detectors is considered, where each of the terminals observes a memoryless source sequence and the sensor sends a common message to all the detectors. The communication of this…

Information Theory · Computer Science 2018-05-17 Pierre Escamilla , Michèle Wigger , Abdellatif Zaidi

We consider the classical sequential binary hypothesis testing problem in which there are two hypotheses governed respectively by distributions $P_0$ and $P_1$ and we would like to decide which hypothesis is true using a sequential test. It…

Information Theory · Computer Science 2020-07-01 Yonglong Li , Vincent Y. F. Tan

The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is…

Information Theory · Computer Science 2019-04-24 Nir Weinberger , Yuval Kochman

Coding and testing schemes for binary hypothesis testing over noisy networks are proposed and their corresponding type-II error exponents are derived. When communication is over a discrete memoryless channel (DMC), our scheme combines…

Information Theory · Computer Science 2018-06-15 Sadaf Salehkalaibar , Michele Wigger

The achievable error-exponent pairs for the type I and type II errors are characterized in a hypothesis testing setup where the observation consists of independent and identically distributed samples from either a known joint probability…

Information Theory · Computer Science 2018-09-19 Amos Lapidoth , Christoph Pfister

We study a class of distributed hypothesis testing against conditional independence problems. Under the criterion that stipulates minimization of the Type II error rate subject to a (constant) upper bound $\epsilon$ on the Type I error…

Information Theory · Computer Science 2019-04-08 Abdellatif Zaidi , Inaki Estella Aguerri

The first- and second-order optimum achievable exponents in the simple hypothesis testing problem are investigated. The optimum achievable exponent for type II error probability, under the constraint that the type I error probability is…

Information Theory · Computer Science 2018-04-04 Te Sun Han , Ryo Nomura

The main contribution of this paper is a strong converse result for $K$-hop distributed hypothesis testing against independence with multiple (intermediate) decision centers under a Markov condition. Our result shows that the set of type-II…

Information Theory · Computer Science 2022-05-19 Mustapha Hamad , Michèle Wigger , Mireille Sarkiss

We revisit the problem of asymmetric binary hypothesis testing against a composite alternative hypothesis. We introduce a general framework to treat such problems when the alternative hypothesis adheres to certain axioms. In this case we…

Information Theory · Computer Science 2017-12-12 Marco Tomamichel , Masahito Hayashi

In clinical studies upon which decisions are based there are two types of errors that can be made: a type I error arises when the decision is taken to declare a positive outcome when the truth is in fact negative, and a type II error arises…

Methodology · Statistics 2024-09-19 Andrew P Grieve

This work analyzes the asymptotic performances of fully distributed sequential hypothesis testing procedures as the type-I and type-II error rates approach zero, in the context of a sensor network without a fusion center. In particular, the…

Applications · Statistics 2018-04-17 Shang Li , Xiaodong Wang

We revisit $M$-ary classification of Gutman (TIT 1989), where one is tasked to determine whether a testing sequence is generated with the same distribution as one of the $M$ training sequences or not. Our main result is a two-phase test,…

Information Theory · Computer Science 2023-05-29 Lin Zhou , Jun Diao , Lin Bai

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations,…

Information Theory · Computer Science 2017-03-02 Gil Katz , Pablo Piantanida , Mérouane Debbah

We consider the problem of decentralized hypothesis testing under communication constraints in a topology where several peripheral nodes are arranged in tandem. Each node receives an observation and transmits a message to its successor, and…

Information Theory · Computer Science 2015-06-19 Alla Tarighati , Joakim Jalden

In this paper, two-hop communication between a source and a destination with the aid of an intermediate relay node is considered. Both the source and intermediate relay node are assumed to operate under statistical quality of service (QoS)…

Information Theory · Computer Science 2010-10-01 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

In this paper we revisit the binary hypothesis testing problem with one-sided compression. Specifically we assume that the distribution in the null hypothesis is a mixture distribution of iid components. The distribution under the…

Information Theory · Computer Science 2022-07-07 Minh Thanh Vu

In this paper, we consider a bidirectional relay network with half-duplex nodes and block fading where the nodes transmit with a fixed transmission rate. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct…

Information Theory · Computer Science 2016-11-15 Vahid Jamali , Nikola Zlatanov , Robert Schober

We study error exponents for the problem of relaying a message over a tandem of two channels sharing the same transition law, in particular moving beyond the 1-bit setting studied in recent related works. Our main results show that the…

Information Theory · Computer Science 2023-02-28 Yan Hao Ling , Jonathan Scarlett