Gaussian Multiplier Bootstrap Procedure for the kth Largest Coordinate of High-Dimensional Statistics
Abstract
We consider the problem of Gaussian multiplier bootstrap procedures for the kth largest statistics and functions of the top k order statistics, which are commonly encountered in high-dimensional statistical inference. Such a problem has been studied previously for k=1 (i.e., maxima). However, in many applications, a general k (k≥ 1) is of great interest. We provide the upper bounds for the errors between Gaussian approximations and Gaussian multiplier approximations. The dimension p is allowed to be larger than the sample size n. The effectiveness of the proposed methods is demonstrated via the computer numerical results and a real-world data analysis.
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.