Adaptive Confidence Sets for Binary Regression without Design Smoothness
P. M. Aronow, Patrick Lopatto
Abstract
We study honest adaptive confidence sets for the regression function in random-design binary regression under L2(dx) loss. Assuming only known bounds 0<c≤ g≤ C<∞ on the unknown design density, we construct asymptotically honest, rate-adaptive confidence sets without requiring g to be smooth. Full adaptation is possible when the range of regression-function smoothness spans at most a factor of two. Over wider smoothness ranges, adaptation is achieved on the usual separated classes at the corresponding testing rates n-2s/(4s+d). A lower bound under the uniform design shows that these separation rates are rate-optimal. This answers a question raised by Mukherjee and Sen (2018).
Create a lesson
Related papers
Minimax optimality for sequential gradient-free minimization of smooth functions and their derivatives
Théo Paquier, Alexandre B Tsybakov, François Portier et al.
Randomization Inference with Concentration Inequalities
Tobias Freidling
On the continuity of the Tukey depth function for fuzzy data
Luis González-De La Fuente, Alicia Nieto-Reyes, Pedro Terán
Recursive-Head Geometry and Order-Free Efficient Inference in Finite-State Nested Markov Models
Haoyu Wei
Finite-Sample Hausdorff Bounds and Hadamard Sensitivity for Regressions with MNAR Covariates
Hugo Dunias
Semiparametric Efficient Inference under Non-Informative Complex Survey Designs
Hiroki Chiba, Kosuke Morikawa