Semi-parametric inference based on adaptively collected data
Licong Lin, Koulik Khamaru, Martin J. Wainwright
TL;DR
This work develops AdapTZ, a family of adaptive two-stage $Z$-estimators for semi-parametric models under adaptively collected data. It establishes asymptotic normality for target parameters in both partial linear models and generalized linear models by leveraging Neyman orthogonality and adaptive re-weighting to neutralize nuisance perturbations. The results hold under mild explorability conditions on data collection, including decay bounds on selection probabilities, and extend to fixed-direction inferences with weaker requirements. Numerical experiments on adaptive linear and logistic models illustrate improved confidence interval coverage over traditional methods. The framework also covers sparse high-dimensional and nonparametric nuisance settings, with several corollaries demonstrating practical pilot-estimator choices such as OLS, Lasso, and $k$-NN pilots, and addresses scenarios where selection probabilities are unknown. This provides a principled path for valid inference in sequential, bandit-like data collection contexts with complex nuisance structure.
Abstract
Many standard estimators, when applied to adaptively collected data, fail to be asymptotically normal, thereby complicating the construction of confidence intervals. We address this challenge in a semi-parametric context: estimating the parameter vector of a generalized linear regression model contaminated by a non-parametric nuisance component. We construct suitably weighted estimating equations that account for adaptivity in data collection, and provide conditions under which the associated estimates are asymptotically normal. Our results characterize the degree of "explorability" required for asymptotic normality to hold. For the simpler problem of estimating a linear functional, we provide similar guarantees under much weaker assumptions. We illustrate our general theory with concrete consequences for various problems, including standard linear bandits and sparse generalized bandits, and compare with other methods via simulation studies.
