Rank Verification for Exponential Families
Kenneth Hung, William Fithian

TL;DR
This paper introduces simple, valid statistical tests for verifying if the observed top candidate or treatment truly ranks first in noisy experiments involving exponential family models, with extensions to confidence bounds and higher ranks.
Contribution
It provides a straightforward method for rank verification in exponential families, including tests and confidence bounds, under mild conditions, improving post hoc analysis of experimental data.
Findings
Two-tailed pairwise test is valid for top two comparisons
Method extends to confidence bounds on the gap
Applicable to verifying higher ranks
Abstract
Many statistical experiments involve comparing multiple population groups. For example, a public opinion poll may ask which of several political candidates commands the most support; a social scientific survey may report the most common of several responses to a question; or, a clinical trial may compare binary patient outcomes under several treatment conditions to determine the most effective treatment. Having observed the "winner" (largest observed response) in a noisy experiment, it is natural to ask whether that candidate, survey response, or treatment is actually the "best" (stochastically largest response). This article concerns the problem of rank verification --- post hoc significance tests of whether the orderings discovered in the data reflect the population ranks. For exponential family models, we show under mild conditions that an unadjusted two-tailed pairwise test…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
