The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths

Mean testing over ellipses is a decision problem that arises in several applications, including non-parametric goodness-of-fit testing, signal detection in cognitive radio, and regression function testing in reproducing kernel Hilbert spaces. We study the local geometry of such testing problems with compound alternatives. Given samples of a Gaussian random vector, the goal is to distinguish whether the mean is equal to a known vector within an ellipse, or equal to some other unknown vector in the ellipse. While past work on such problems has focused on the difficulty in a global sense, we study difficulty in a way that is localized to each vector within the ellipse. Our main result is to give sharp upper and lower bounds on the localized minimax testing radius in terms of an explicit formula involving the Kolmogorov width of the ellipse intersected with a Euclidean ball. When applied to particular examples, our general theorems yield interesting rates that were not known before: as a particular case, for testing in Sobolev ellipses of smoothness <inline-formula> <tex-math notation="LaTeX">$\alpha $ </tex-math></inline-formula>, we demonstrate rates that vary from <inline-formula> <tex-math notation="LaTeX">$(\sigma ^{2})^{\frac {4 \alpha }{4 \alpha + 1}}$ </tex-math></inline-formula>, corresponding to the classical global rate, to the faster rate <inline-formula> <tex-math notation="LaTeX">$(\sigma ^{2})^{\frac {8 \alpha }{8 \alpha + 1}}$ </tex-math></inline-formula>, achievable for vectors at favorable locations within the ellipse. We also show that the optimal test for this problem is achieved by a linear projection test that is based on an explicit lower-dimensional projection of the observation vector.

[1]  E. L. Lehmann,et al.  Theory of point estimation , 1950 .

[2]  Steven A. Orszag,et al.  CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS , 1978 .

[3]  R. Z. Khasʹminskiĭ,et al.  Statistical estimation : asymptotic theory , 1981 .

[4]  A. Pinkus.  n-Widths in Approximation Theory , 1985 .

[5]  Yu. I. Ingster.  Minimax Testing of Nonparametric Hypotheses on a Distribution Density in the $L_p$ Metrics , 1987 .

[6]  I. Ibragimov,et al.  On density estimation in the view of Kolmogorov's ideas in approximation theory , 1990 .

[7]  G. Wahba.  Spline models for observational data , 1990 .

[8]  D. Donoho,et al.  Minimax Risk Over Hyperrectangles, and Implications , 1990 .

[9]  M. Ermakov.  Minimax Detection of a Signal In a Gaussian White Noise , 1991 .

[10]  P. Bickel.  Efficient and Adaptive Estimation for Semiparametric Models , 1993 .

[11]  I. Johnstone,et al.  Ideal spatial adaptation by wavelet shrinkage , 1994 .

[12]  K. Do,et al.  Efficient and Adaptive Estimation for Semiparametric Models. , 1994 .

[13]  V. Spokoiny,et al.  Minimax Nonparametric Hypothesis Testing: The Case of an Inhomogeneous Alternative , 1999 .

[14]  A. Tsybakov,et al.  Asymptotically exact nonparametric hypothesis testing in sup-norm and at a fixed point , 2000 .

[15]  Mary C. Meyer,et al.  ON THE DEGREES OF FREEDOM IN SHAPE-RESTRICTED REGRESSION , 2000 .

[16]  S. Geer.  Empirical Processes in M-Estimation , 2000 .

[17]  Chong Gu.  Smoothing Spline Anova Models , 2002 .

[18]  Y. Baraud.  Non-asymptotic minimax rates of testing in signal detection , 2002 .

[19]  C. Pouet.  Nonparametric Goodness-of-Fit Testing Under Gaussian Models , 2004 .

[20]  Stephen E. Fienberg,et al.  Testing Statistical Hypotheses , 2005 .

[21]  P. Bartlett,et al.  Local Rademacher complexities , 2005, math/0508275.

[22]  Mohamed-Slim Alouini,et al.  On the Energy Detection of Unknown Signals Over Fading Channels , 2007, IEEE Transactions on Communications.

[23]  Alexandre B. Tsybakov,et al.  Introduction to Nonparametric Estimation , 2008, Springer series in statistics.

[24]  Adel Javanmard,et al.  The minimax risk of truncated series estimators for symmetric convex polytopes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[25]  Hai Jiang,et al.  Energy Detection for Spectrum Sensing in Cognitive Radio , 2014, SpringerBriefs in Computer Science.

[26]  Gregory Valiant,et al.  An Automatic Inequality Prover and Instance Optimal Identity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[27]  Fabrice Labeau,et al.  On Signal Detection in the Presence of Weakly Correlated Noise over Fading Channels , 2014, IEEE Transactions on Communications.

[28]  Adityanand Guntuboyina,et al.  On risk bounds in isotonic and other shape restricted regression problems , 2013, 1311.3765.

[29]  T. Cai,et al.  A Framework For Estimation of Convex Functions , 2015 .

[30]  P. Wojtaszczyk.  On greedy algorithm approximating Kolmogorov widths in Banach spaces , 2015 .

[31]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[32]  Adityanand Guntuboyina,et al.  Adaptive estimation of planar convex sets , 2015, The Annals of Statistics.

[33]  Sivaraman Balakrishnan,et al.  Hypothesis Testing For Densities and High-Dimensional Multinomials: Sharp Local Minimax Rates , 2017, The Annals of Statistics.

[34]  Martin J. Wainwright,et al.  High-Dimensional Statistics , 2019 .

[35]  Martin J. Wainwright,et al.  The geometry of hypothesis testing over convex cones: Generalized likelihood tests and minimax radii , 2017, The Annals of Statistics.