Worst-case Nonparametric Bounds for the Student T-statistic
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 St77 and W11) Q(S(w);α) over nonnegative weight vectors w∈n with \|w\|2=1, where S(w)=Σi=1n wi i and i 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 α<1 2 and each n, we determine the maximal value and characterise all maximising weights. The maximisers are k-sparse equal-weight vectors with weights 1/k, and the optimal support size k is found by a finite search over at most n candidates. This yields an explicit envelope Mn(α) and its universal limit as n grows. Our results provide exact solutions to problems that have been studied through bounds and approximations for over sixty years, with applications to nonparametric inference, self-standardised statistics, and robust hypothesis testing under symmetry assumptions, including a conjecture by Edelmanedelman1990, albeit for continuous distributions only (which he did not specify, which has been found to not always hold otherwise)
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.