A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Uniformly Most Powerful Tests

Graduate Depth 112 in the knowledge graph I know this Set as goal
1topic build on this
747prerequisites beneath it
See this on the map →
Neyman-Pearson LemmaLikelihood Ratio TestsConfidence Intervals (Rigorous Theory)
ump-tests hypothesis-testing statistics

Core Idea

A UMP test maximizes power (Type II error) uniformly over all alternatives. By Neyman-Pearson, UMP tests exist for simple vs. simple hypotheses. For composite alternatives (e.g., H₁: θ > θ₀), UMP tests may not exist, but UMP unbiased tests sometimes do. The likelihood ratio test is often asymptotically UMP.

Explainer

From the Neyman-Pearson Lemma, you know how to build the most powerful test when both the null and alternative are simple (single-point) hypotheses: reject H₀ when the likelihood ratio f(x; θ₁)/f(x; θ₀) exceeds a threshold c. This test is optimal in the sense that no other test at the same significance level α has higher power 1 − β, where β is the probability of missing a true alternative. The question that leads to UMP tests is: does this optimality extend when the alternative is composite — that is, when H₁ specifies a range of values like θ > θ₀?

A Uniformly Most Powerful (UMP) test is a test that, for every specific alternative value θ₁ in H₁, is the most powerful test at level α. "Uniformly" means the optimality holds simultaneously for the entire alternative region, not just at one point. For this to work, the critical region identified by Neyman-Pearson must be the same regardless of which specific θ₁ you plug in. When this happens, a single test achieves maximum power everywhere in H₁.

The condition that guarantees this is the monotone likelihood ratio (MLR) property. A family of distributions {f(x; θ)} has an MLR in a statistic T(x) if the likelihood ratio f(x; θ₁)/f(x; θ₀) is a non-decreasing function of T(x) whenever θ₁ > θ₀. In such families, the Neyman-Pearson critical region {T(x) > c} is the same for every θ₁ > θ₀, so the test is UMP for the one-sided alternative H₁: θ > θ₀. Exponential family distributions — Normal, Poisson, Binomial, Exponential — all have MLR in their natural sufficient statistic, which explains why clean one-sided tests exist for these distributions.

UMP tests generally do not exist for two-sided alternatives H₁: θ ≠ θ₀, because the most powerful test against θ₁ > θ₀ rejects in the right tail, while the most powerful test against θ₁ < θ₀ rejects in the left tail — no single critical region dominates both directions simultaneously. The resolution is UMP unbiased (UMPU) tests, which restrict attention to tests satisfying a bias condition (power ≥ α everywhere in H₁), and then find the most powerful unbiased test. For exponential families, UMPU tests for two-sided alternatives have critical regions in both tails, recovering the familiar two-sided t-test as a special case.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionSine, Cosine, and Tangent RatiosTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIndefinite IntegralsBasic Integration RulesRiemann SumsDefinite Integral DefinitionFundamental Theorem of Calculus Part 1Fundamental Theorem of Calculus Part 2U-SubstitutionPartial Fraction Decomposition for IntegrationImproper Integrals - ConvergenceIntegral TestP-SeriesComparison TestLimit Comparison TestSeries Convergence Test StrategyPower SeriesRadius and Interval of ConvergenceTaylor SeriesMoment Generating FunctionsCharacteristic FunctionsConvergence in DistributionStationary DistributionsConvergence of Markov ChainsConvergence in ProbabilityAlmost Sure ConvergenceRelationships Between Modes of ConvergenceWeak Law of Large NumbersStrong Law of Large NumbersCentral Limit Theorem (Rigorous via Characteristic Functions)Maximum Likelihood Estimation (Theory)Neyman-Pearson LemmaLikelihood Ratio TestsUniformly Most Powerful Tests

Longest path: 113 steps · 747 total prerequisite topics

Prerequisites (2)

Leads To (1)