Data-Driven Influence Functions for Optimization-Based Causal Inference
Not on the map. Why?
Abstract (arXiv)
We study a constructive algorithm that approximates Gateaux derivatives for statistical functionals by finite differencing, with a focus on functionals that arise in causal inference. We study the case where probability distributions are not known a priori but need to be estimated from data. These estimated distributions lead to empirical Gateaux derivatives, and we study the relationships between empirical, numerical, and analytical Gateaux derivatives. Starting with a case study of the interventional mean (average potential outcome), we delineate the relationship between finite differences and the analytical Gateaux derivative. We then derive requirements on the rates of numerical approximation in perturbation and smoothing that preserve the statistical benefits of one-step adjustments, such as rate double robustness. We then study more complicated functionals such as dynamic treatment regimes, the linear-programming formulation for policy optimization in infinite-horizon Markov decision processes, and sensitivity analysis in causal inference. More broadly, we study optimization-based estimators, since this begets a class of estimands where identification via regression adjustment is straightforward but obtaining influence functions under minor variations thereof is not. The ability to approximate bias adjustments in the presence of arbitrary constraints illustrates the usefulness of constructive approaches for Gateaux derivatives. We also find that the statistical structure of the functional (rate double robustness) can permit less conservative rates for finite-difference approximation. This property, however, can be specific to particular functionals; e.g., it occurs for the average potential outcome (hence average treatment effect) but not the infinite-horizon MDP policy value.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 30 of its 80 references that are in the map. First posted on arXiv 29 Aug 2022.
Builds on
30 of 80 references.
References · 30
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 339
- 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 286
- 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 227
- 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 198
- 2022Semiparametric doubly robust targeted double machine learning: a reviewcited by 133
- 2019Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processescited by 119
- 2019Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learningcited by 75
- 2020Confounding-Robust Policy Evaluation in Infinite-Horizon Reinforcement Learningcited by 57
- 2018A Swiss Army Infinitesimal Jackknifecited by 54
- 2021RieszNet and ForestRiesz: Automatic Debiased Machine Learning with Neural Nets and Random Forestscited by 42
- 2016Asymptotic Optimality in Stochastic Optimizationcited by 38
18 more
- 2015The Influence Function of Semiparametric Estimatorscited by 36
- 2020Adversarial Estimation of Riesz Representerscited by 35
- 2021Doubly-Valid/Doubly-Sharp Sensitivity Analysis for Causal Inference with Unmeasured Confoundingcited by 28
- 2019Localized Debiased Machine Learning: Efficient Inference on Quantile Treatment Effects and Beyondcited by 23
- 2020Semiparametric Inference For Causal Effects In Graphical Models With Hidden Variablescited by 23
- 2020Randomized Automatic Differentiationcited by 23
- 2018Visually Communicating and Teaching Intuition for Influence Functionscited by 19
- 2019More Efficient Off-Policy Evaluation through Regularized Targeted Learningcited by 17
- 2019A Higher-Order Swiss Army Infinitesimal Jackknifecited by 14
- 2019Sensitivity analysis via the proportion of unmeasured confoundingcited by 13
- 2021Debiasing In-Sample Policy Performance for Small-Data, Large-Scale Optimizationcited by 10
- 2021Semiparametric sensitivity analysis: unmeasured confounding in observational studiescited by 8
- 2018Stochastic Primal-Dual Q-Learningcited by 7
- 2021Stateful Offline Contextual Policy Evaluation and Learningcited by 6
- 2020Assessing External Validity Over Worst-case Subpopulationscited by 5
- 2022Variance-based sensitivity analysis for weighting estimators result in more informative boundscited by 4
- 2019Large-Scale Markov Decision Problems via the Linear Programming Dualcited by 3
- 2022Off-Policy Evaluation with Policy-Dependent Optimization Responsecited by 3
Built on by
Citing papers per year: 2024: 1.
1 paper.