Error exponents in hypothesis testing
# Error exponents in hypothesis testing

In statistical hypothesis testing, the error exponent of a hypothesis testing procedure is the rate at which the probabilities of Type I and Type II decay exponentially with the size of the sample used in the test. For example, if the probability of error $P_{\mathrm {error} }$ of a test decays as $e^{-n\beta }$, where $n$ is the sample size, the error exponent is $\beta$.

Formally, the error exponent of a test is defined as the limiting value of the ratio of the negative logarithm of the error probability to the sample size for large sample sizes: $\lim _{n\to \infty }{\frac {-\ln P_{\text{error}}}{n}}$. Error exponents for different hypothesis tests are computed using Sanov's theorem and other results from large deviations theory.

## Error exponents in binary hypothesis testing

Consider a binary hypothesis testing problem in which observations are modeled as independent and identically distributed random variables under each hypothesis. Let $Y_{1},Y_{2},\ldots ,Y_{n}$ denote the observations. Let $f_{0}$ denote the probability density function of each observation $Y_{i}$ under the null hypothesis $H_{0}$ and let $f_{1}$ denote the probability density function of each observation $Y_{i}$ under the alternate hypothesis $H_{1}$.

In this case there are two possible error events. Error of type 1, also called false positive, occurs when the null hypothesis is true and it is wrongly rejected. Error of type 2, also called false negative, occurs when the alternate hypothesis is true and null hypothesis is not rejected. The probability of type 1 error is denoted $P(\mathrm {error} \mid H_{0})$ and the probability of type 2 error is denoted $P(\mathrm {error} \mid H_{1})$.

### Optimal error exponent for Neyman–Pearson testing

In the Neyman–Pearson version of binary hypothesis testing, one is interested in minimizing the probability of type 2 error $P({\text{error}}\mid H_{1})$ subject to the constraint that the probability of type 1 error $P({\text{error}}\mid H_{0})$ is less than or equal to a pre-specified level $\alpha$. In this setting, the optimal testing procedure is a likelihood-ratio test. Furthermore, the optimal test guarantees that the type 2 error probability decays exponentially in the sample size $n$ according to $\lim _{n\to \infty }{\frac {-\ln P(\mathrm {error} \mid H_{1})}{n}}=D(f_{0}\parallel f_{1})$. The error exponent $D(f_{0}\parallel f_{1})$ is the Kullback–Leibler divergence between the probability distributions of the observations under the two hypotheses. This exponent is also referred to as the Chernoff–Stein lemma exponent.

### Optimal error exponent for average error probability in Bayesian hypothesis testing

In the Bayesian version of binary hypothesis testing one is interested in minimizing the average error probability under both hypothesis, assuming a prior probability of occurrence on each hypothesis. Let $\pi _{0}$ denote the prior probability of hypothesis $H_{0}$. In this case the average error probability is given by $P_{\text{ave}}=\pi _{0}P({\text{error}}\mid H_{0})+(1-\pi _{0})P({\text{error}}\mid H_{1})$. In this setting again a likelihood ratio test is optimal and the optimal error decays as $\lim _{n\to \infty }{\frac {-\ln P_{\text{ave}}}{n}}=C(f_{0},f_{1})$ where $C(f_{0},f_{1})$ represents the Chernoff-information between the two distributions defined as $C(f_{0},f_{1})=\max _{\lambda \in [0,1]}\left[-\ln \int (f_{0}(x))^{\lambda }(f_{1}(x))^{(1-\lambda )}\,dx\right]$.

