Nonasymptotic one-and two-sample tests in high dimension with unknown covariance structure
Gilles Blanchard (LMO, DATASHAPE), Jean-Baptiste Fermanian (ENS, Rennes, LMO)

TL;DR
This paper develops nonasymptotic tests for high-dimensional mean vectors with unknown covariance, providing bounds on the minimal detectable difference and analyzing dependence on distribution pseudo-dimension.
Contribution
It introduces nonasymptotic bounds for one- and two-sample mean testing in high dimensions with unknown covariance, emphasizing dependence on pseudo-dimension and distribution properties.
Findings
Bounds on minimal separation distance depend on pseudo-dimension $d_*$.
For $oxed{0}$-mean, separation distance scales as $d_*^{1/4} imes ext{sqrt}( ext{operator norm}/n)$.
Results apply to Gaussian and bounded distributions, highlighting the role of covariance structure.
Abstract
Let be an i.i.d. sample of square-integrable variables in , \GB{with common expectation and covariance matrix , both unknown.} We consider the problem of testing if is -close to zero, i.e. against ; we also tackle the more general two-sample mean closeness (also known as {\em relevant difference}) testing problem. The aim of this paper is to obtain nonasymptotic upper and lower bounds on the minimal separation distance such that we can control both the Type I and Type II errors at a given level. The main technical tools are concentration inequalities, first for a suitable estimator of used a test statistic, and secondly for estimating the operator and Frobenius norms of coming into the quantiles of said test statistic. These…
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
TopicsStatistical Methods and Inference · Markov Chains and Monte Carlo Methods · Random Matrices and Applications
