Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models
<|reference_start|>Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models: This paper proposes an asymptotic theory for online inference of the stochastic gradient descent (SGD) iterates with dropout regularization in linear regression. Specifically, we establish the geometric-moment contraction (GMC) for constant step-size SGD dropout iterates to show the existence of a unique stationary distribution of the dropout recursive function. By the GMC property, we provide quenched central limit theorems (CLT) for the difference between dropout and $\ell^2$-regularized iterates, regardless of initialization. The CLT for the difference between the Ruppert-Polyak averaged SGD (ASGD) with dropout and $\ell^2$-regularized iterates is also presented. Based on these asymptotic normality results, we further introduce an online estimator for the long-run covariance matrix of ASGD dropout to facilitate inference in a recursive manner with efficiency in computational time and memory. The numerical experiments demonstrate that for sufficiently large samples, the proposed confidence intervals for ASGD with dropout nearly achieve the nominal coverage probability.<|reference_end|>
@article{li2024asymptotics,
    title={Asymptotics of Stochastic Gradient Descent with Dropout Regularization
  in Linear Models},
    author={Jiaqi Li, Johannes Schmidt-Hieber and Wei Biao Wu},
    journal={arXiv preprint arXiv:2409.07434},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.07434},
    primaryClass={stat.ML cs.LG math.ST stat.TH}
}