Increasing Missingness to Reduce Bias: Richardson-SGD with Missing Data
Not on the map. Why?
Abstract (arXiv)
Stochastic gradient methods are central to modern large-scale learning, but their use with incomplete covariates remains delicate since imputation schemes generally introduce systematic gradient biases, as shown for linear models. In this work, we prove that all parametric models exhibit similar gradient bias for various imputation procedures and characterize exactly the dependence on the missingness ratio vector p, with O(|p|) as the leading term. We exploit this analysis to propose a simple debiasing procedure for stochastic gradient descent (SGD) with missing values based on Richardson extrapolation, which leverages the exact expression of the gradient bias. The key idea is to deliberately add missingness: from an already incomplete observation, we generate a further-thinned version at a higher, controlled missingness level, and combine the two resulting stochastic gradients to cancel the leading bias term. We prove that one Richardson step reduces the gradient bias from O(|p|) to O(|p|2) under several missingness scenarios. Our proposed method is computationally efficient, model-agnostic and applies to any parametric loss whose stochastic gradient can be computed after imputation. Furthermore, when missing indicators are independent, the population gradient bias is a multilinear polynomial in p and depends only on population gradient errors induced by declaring a single coordinate missing. In this case, our method generalizes to a multi-step Richardson procedure which recursively cancels higher-order terms. Empirically, Richardson debiasing improves optimization and estimation across several generalized linear models and combines positively with widely used imputation procedures such as MICE. These results suggest that, somewhat counter-intuitively, adding controlled missingness on top of existing missing data can make stochastic learning from incomplete data more accurate.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 41 references that are in the map. First posted on arXiv 19 May 2026.
Builds on
10 of 41 references.
References · 10
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 183
- 2020On the Convergence of SGD with Biased Gradientscited by 79
- 2021What's a good imputation to predict with missing values?cited by 61
- 2019On the consistency of supervised learning with missing valuescited by 52
- 2023A Guide Through the Zoo of Biased SGDcited by 39
- 2013Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regressioncited by 32
- 2022The Missing Indicator Method: From Low to High Dimensionscited by 19
- 2020Imputation for High-Dimensional Linear Regressioncited by 9
- 2024Random features models: a way to study the success of naive imputationcited by 7
- 2024High-dimensional logistic regression with missing data: Imputation, regularization, and universalitycited by 4
Built on by
Not cited yet.