Draft:Universal Hypothesis Testing

In statistics, universal hypothesis testing is a special case of binary simple hypothesis testing. The universal problem is to distinguish between a simple null hypothesis ${\displaystyle H_{0}:Q=P}$, and the most general composite alternative ${\displaystyle H_{1}:Q\neq P}$, using independent and identically distributed samples from ${\displaystyle Q}$. The setting is sometimes referred to as goodness of fit testing, or one-sample testing.

Review waiting, please be patient. This may take 8 weeks or more, since drafts are reviewed in no specific order. There are 2,979 pending submissions waiting for review. If the submission is accepted, then this page will be moved into the article space. If the submission is declined, then the reason will be posted here. In the meantime, you can continue to improve this submission by editing normally. Where to get help If you need help editing or submitting your draft, please ask us a question at the AfC Help Desk or get live help from experienced editors. These venues are only for help with editing and the submission process, not to get reviews. If you need feedback on your draft, or if the review is taking a lot of time, you can try asking for help on the talk page of a relevant WikiProject. Some WikiProjects are more active than others so a speedy reply is not guaranteed. How to improve a draft Wikipedia:Contributing to Wikipedia – a basic overview on how to edit Wikipedia. Help:Wikitext – how to use the markup Help:Referencing for beginners – how to include references Wikipedia:Article development – how to develop your article Wikipedia:Writing better articles – how to improve your article Wikipedia:Verifiability – make sure your article includes reliable third-party sources You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Add tags to your draft Editor resources Easy tools: Citation bot (help) | Advanced: Fix bare URLs Reviewer tools Instructions · What links here · Universal Hypothesis Testing (talk: + · bio) · (log) · Copyvios report · reFill · Citation Bot · (Search: Google, Wikipedia) · Submitted 46 days ago by ArickGrootveld (talk: D · +) · Last edited 4 days ago by Keith D

• Comment: In accordance with Wikipedia's Conflict of interest guideline, I disclose that I have a conflict of interest regarding the subject of this article. ArickGrootveld (talk) 20:37, 28 January 2026 (UTC)

A simple binary hypothesis testing problem involves distinguishing between ${\displaystyle H_{0}:Q=P_{0}}$ and ${\displaystyle H_{1}:Q=P_{1}}$, using samples ${\displaystyle X_{1},\dots ,X_{n}{\overset {\text{i.i.d.}}{\sim }}Q}$. In the traditional setting of hypothesis testing ${\displaystyle P_{0},P_{1}}$ are known apriori. A composite version of this problem involves sets of probability distributions ${\displaystyle \Omega _{0},\Omega _{1}}$, and asks to distinguish between ${\displaystyle H_{0}:Q\in \Omega _{0}}$ and ${\displaystyle H_{1}:Q\in \Omega _{1}}$. In contrast, the universal setting corresponds to the special case of composite hypothesis testing, where the null hypothesis is simple, ${\displaystyle \Omega _{0}=P}$ and the alternative hypothesis is the set of all distributions other than ${\displaystyle P}$, ${\displaystyle \Omega _{1}=\{F:F\neq P\}}$. For example, someone might want to know if a particular coin was fair, i.e. ${\displaystyle \mathbb {P} [X=H]={\frac {1}{2}}=\mathbb {P} [X=T]}$ or not, i.e. ${\displaystyle \mathbb {P} [X=H]\neq \mathbb {P} [X=T]}$, where ${\displaystyle H,T}$ denote the coin coming up heads or tails.

The asymptotics of universal hypothesis testing were first discussed in Hoeffding's work on optimal tests for multinomial distributions^[1]. There have been many subsequent works on the topic^[2][3][4] in many directions. While Hoeffding's initial results were restricted to distributions with finite supports, later results developed solutions for continuous distributions using extensions of the Kullback-Leibler Divergence^[5], or kernel methods^[6][7].