Second-Order Asymptotics of Sequential Hypothesis Testing
From MaRDI portal
Abstract: We consider the classical sequential binary hypothesis testing problem in which there are two hypotheses governed respectively by distributions and and we would like to decide which hypothesis is true using a sequential test. It is known from the work of Wald and Wolfowitz that as the expectation of the length of the test grows, the optimal type-I and type-II error exponents approach the relative entropies and . We refine this result by considering the optimal backoff---or second-order asymptotics---from the corner point of the achievable exponent region under two different constraints on the length of the test (or the sample size). First, we consider a probabilistic constraint in which the probability that the length of test exceeds a prescribed integer is less than a certain threshold . Second, the expectation of the sample size is bounded by . In both cases, and under mild conditions, the second-order asymptotics is characterized exactly. Numerical examples are provided to illustrate our results.
Cited in
(3)
This page was built for publication: Second-Order Asymptotics of Sequential Hypothesis Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138886)