Worst-case Nonparametric Bounds for the Student T-statistic
David Edelman

TL;DR
This paper precisely determines the worst-case nonparametric bounds for the Student T-statistic by solving an extremal problem involving mid-quantiles, providing explicit formulas and characterizations for optimal weights.
Contribution
It solves an open extremal problem exactly, characterizing the maximal bounds and optimal weight vectors for the T-statistic's nonparametric bounds.
Findings
Maximal bounds are achieved by k-sparse equal-weight vectors.
Optimal support size k is found via finite search over at most n candidates.
Provides explicit envelope M_n(α) and its universal limit as n grows.
Abstract
We address the problem of finding worst-case nonparametric bounds for T-statistic by considering the extremal problem of maximising the mid-quantile (a special case of 'smoothed quantile' as discussed in \cite{St77} and \cite{W11}) over nonnegative weight vectors with , where and are independent Rademacher variables. While classical results of Hoeffding [1] and Chernoff [2] may be used to provide sub-Gaussian upper bounds, and optimal-order inequalities were later obtained by the author [3,4], the associated extremal problem has remained unsolved. We resolve this problem exactly (for the Mid-Quantile and, trivially, the Continuous case): for each and each , we determine the maximal value and characterise all maximising weights. The maximisers are -sparse…
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.
Taxonomy
TopicsAdvanced Statistical Methods and Models · Statistics Education and Methodologies · Advanced Statistical Process Monitoring
