Statistics Hypothesis testing Concept
Uniformly most powerful test
Summary
A uniformly most powerful test of level is a hypothesis test of level with the largest possible power. Its power beats that of every other test of level , at every parameter value of the alternative. For simple hypotheses the Neyman–Pearson lemma gives such a test. For one-sided hypotheses in families with a monotone likelihood ratio, the Karlin–Rubin theorem gives one. For many other problems no such test exists.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | QRAPTPVH8C |
|---|---|
| URI | m2://QRAPTPVH8C |
| Kind | concept |
| Writing | W0 stub |
| MSC | 62F03 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.