| Paper ID | D5-S3-T3.1 |
| Paper Title |
Optimal Confidence Sets for the Multinomial Parameter |
| Authors |
Matthew Malloy, University of Wisconsin, United States; Ardhendu Tripathy, Missouri University of Science and Technology, United States; Robert Nowak, University of Wisconsin, United States |
| Session |
D5-S3-T3: Statistics |
| Chaired Session: |
Friday, 16 July, 22:40 - 23:00 |
| Engagement Session: |
Friday, 16 July, 23:00 - 23:20 |
| Abstract |
Construction of tight confidence sets and intervals is central to statistical inference and decision making. This paper develops new theory showing minimum average volume confidence sets for categorical data. More precisely, consider an empirical distribution $\widehat{\bp}$ generated from $n$ iid realizations of a random variable that takes one of $k$ possible values according to an unknown distribution $\bp$. This is analogous to a single draw from a multinomial distribution. A confidence set is a subset of the probability simplex that depends on $\widehat{\bp}$ and contains the unknown $\bp$ with a specified confidence. This paper shows how one can construct minimum average volume confidence sets. The optimality of the sets translates to improved sample complexity for adaptive machine learning algorithms that rely on confidence sets, regions and intervals.
|
