.png){kind=icon}
.png){kind=icon}
Return
Augmented balancing weights as linear regression
.png){kind=icon}
OA
AI
DOI：10.1093/jrsssb/qkaf019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We provide a novel characterization of augmented balancing weights, also known as automatic debiased machine learning. These popular doubly robust estimators combine outcome modelling with balancing weights-weights that achieve covariate balance directly instead of estimating and inverting the propensity score. When the outcome and weighting models are both linear in some (possibly infinite) basis, we show that the augmented estimator is equivalent to a single linear model with coefficients that combine those of the original outcome model with those from unpenalized ordinary least-squares (OLS). Under certain choices of regularization parameters, the augmented estimator in fact collapses to the OLS estimator alone. We then extend these results to specific outcome and weighting models. We first show that the augmented estimator that uses (kernel) ridge regression for both outcome and weighting models is equivalent to a single, undersmoothed (kernel) ridge regression-implying a novel analysis of undersmoothing. When the weighting model is instead lasso-penalized, we demonstrate a familiar 'double selection' property. Our framework opens the black box on this increasingly popular class of estimators, bridges the gap between existing results on the semiparametric efficiency of undersmoothed and doubly robust estimators, and provides new insights into the performance of augmented balancing weights.
Keywords:
balancing weights
debiased machine learning
doubly robust estimation
undersmoothing
Journal
J
IF:
3.6
Papers:
1.5K
Citations:
3.2W