TY - GEN
T1 - Statistical Limits of Adaptive Linear Models
T2 - 37th Conference on Neural Information Processing Systems, NeurIPS 2023
AU - Lin, Licong
AU - Ghosh, Suvrojit
AU - Ying, Mufang
AU - Khamaru, Koulik
AU - Zhang, Cun Hui
N1 - Publisher Copyright:
© 2023 Neural information processing systems foundation. All rights reserved.
PY - 2023
Y1 - 2023
N2 - Estimation and inference in statistics pose significant challenges when data are collected adaptively.Even in linear models, the Ordinary Least Squares (OLS) estimator may fail to exhibit asymptotic normality for single coordinate estimation and have inflated error.This issue is highlighted by a recent minimax lower bound, which shows that the error of estimating a single coordinate can be enlarged by a multiple of √d when data are allowed to be arbitrarily adaptive, compared with the case when they are i.i.d.Our work explores this striking difference in estimation performance between utilizing i.i.d.and adaptive data.We investigate how the degree of adaptivity in data collection impacts the performance of estimating a low-dimensional parameter component in high-dimensional linear models.We identify conditions on the data collection mechanism under which the estimation error for a low-dimensional parameter component matches its counterpart in the i.i.d.setting, up to a factor that depends on the degree of adaptivity.We show that OLS or OLS on centered data can achieve this matching error.In addition, we propose a novel estimator for single coordinate inference via solving a Two-stage Adaptive Linear Estimating equation (TALE).Under a weaker form of adaptivity in data collection, we establish an asymptotic normality property of the proposed estimator.
AB - Estimation and inference in statistics pose significant challenges when data are collected adaptively.Even in linear models, the Ordinary Least Squares (OLS) estimator may fail to exhibit asymptotic normality for single coordinate estimation and have inflated error.This issue is highlighted by a recent minimax lower bound, which shows that the error of estimating a single coordinate can be enlarged by a multiple of √d when data are allowed to be arbitrarily adaptive, compared with the case when they are i.i.d.Our work explores this striking difference in estimation performance between utilizing i.i.d.and adaptive data.We investigate how the degree of adaptivity in data collection impacts the performance of estimating a low-dimensional parameter component in high-dimensional linear models.We identify conditions on the data collection mechanism under which the estimation error for a low-dimensional parameter component matches its counterpart in the i.i.d.setting, up to a factor that depends on the degree of adaptivity.We show that OLS or OLS on centered data can achieve this matching error.In addition, we propose a novel estimator for single coordinate inference via solving a Two-stage Adaptive Linear Estimating equation (TALE).Under a weaker form of adaptivity in data collection, we establish an asymptotic normality property of the proposed estimator.
UR - http://www.scopus.com/inward/record.url?scp=85191177090&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85191177090&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85191177090
T3 - Advances in Neural Information Processing Systems
BT - Advances in Neural Information Processing Systems 36 - 37th Conference on Neural Information Processing Systems, NeurIPS 2023
A2 - Oh, A.
A2 - Neumann, T.
A2 - Globerson, A.
A2 - Saenko, K.
A2 - Hardt, M.
A2 - Levine, S.
PB - Neural information processing systems foundation
Y2 - 10 December 2023 through 16 December 2023
ER -