Neyman-Pearson lemma
From Wikipedia, the free encyclopedia
In statistics, the Neyman-Pearson lemma states that when performing a hypothesis test between two point hypotheses H0: θ=θ0 and H1: θ=θ1, then the likelihood-ratio test which rejects H0 in favour of H1 when
is the most powerful test of size α for a threshold η. If the test is most powerful for all , it is said to be uniformly most powerful (UMP) for alternatives in the set .
In practice, the likelihood ratio is often used directly to construct tests — see Likelihood-ratio test. However it can also be used to suggest particular test-statistics that might be of interest or to suggest simplified tests — for this one considers algebraic manipulation of the ratio to see if there are key statistics in it is related to the size of the ratio (i.e. whether a large statistic corresponds to a small ratio or to a large one).
Contents |
[edit] Example
Let be a random sample from the N(μ,σ2) distribution where μ is known, and suppose that we wish to test for against .
The likelihood for this set of normally distributed data is
We can compute the likelihood ratio to find the key statistic in this test and its effect on the test's outcome:
This ratio only depends on the data through . Therefore, by the Neyman-Pearson lemma, the most powerful test of this type of hypothesis for this data will depend only on . Also, by inspection, we can see that if , then is a decreasing function of . So we should reject H0 if is sufficiently small. The rejection threshold depends on the size of the test.
[edit] See also
[edit] References
- Jerzy Neyman, Egon Pearson (1933). "On the Problem of the Most Efficient Tests of Statistical Hypotheses". Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character 231: 289-337.
- cnx.org: Neyman-Pearson criterion
[edit] External links
- MIT OpenCourseWare lecture notes: most powerful tests, uniformly most powerful tests