Online Debiasing for Adaptively Collected High-dimensional Data

11/04/2019 ∙ by Yash Deshpande, et al. ∙ 15

Adaptive collection of data is increasingly commonplace in many applications. From the point of view of statistical inference however, adaptive collection induces memory and correlation in the samples, and poses significant challenge. We consider the high-dimensional linear regression, where the samples are collected adaptively and the sample size n can be smaller than p, the number of covariates. In this setting, there are two distinct sources of bias: the first due to regularization imposed for estimation, e.g. using the LASSO, and the second due to adaptivity in collecting the samples. We propose `online debiasing', a general procedure for estimators such as the LASSO, which addresses both sources of bias. In two concrete contexts (i) batched data collection and (ii) high-dimensional time series analysis, we demonstrate that online debiasing optimally debiases the LASSO estimate when the underlying parameter θ_0 has sparsity of order o(√(n)/log p). In this regime, the debiased estimator can be used to compute p-values and confidence intervals of optimal size.



There are no comments yet.


page 7

page 17

page 18

page 24

page 27

page 28

page 29

page 34

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.