Root-n consistent semiparametric learning with high-dimensional nuisance functions under minimal sparsity
Lin Liu, Xinbo Wang, Yuhao Wang

TL;DR
This paper introduces a Double-Calibration method that achieves root-n consistent treatment effect estimation in high-dimensional settings with minimal sparsity assumptions on nuisance functions, even under misspecification.
Contribution
It proposes a novel Double-Calibration strategy that relaxes sparsity requirements for high-dimensional nuisance parameters in treatment effect estimation.
Findings
Achieves $1/\sqrt{n}$-rate under minimal sparsity conditions.
Allows one nuisance parameter to be arbitrarily complex or misspecified.
Applicable to various semiparametric estimation problems.
Abstract
Treatment effect estimation under unconfoundedness is a fundamental task in causal inference. In response to the challenge of analyzing high-dimensional datasets collected in substantive fields such as epidemiology, genetics, economics, and social sciences, various methods for treatment effect estimation with high-dimensional nuisance parameters (the outcome regression and the propensity score) have been developed in recent years. However, it is still unclear what is the necessary and sufficient sparsity condition on the nuisance parameters such that we can estimate the treatment effect at -rate. In this paper, we propose a new Double-Calibration strategy that corrects the estimation bias of the nuisance parameter estimates computed by regularized high-dimensional techniques and demonstrate that the corresponding Doubly-Calibrated estimator achieves -rate as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Causal Inference Techniques · Statistical Methods and Inference · Statistical Methods and Bayesian Inference
