Estimation and Inference of Heterogeneous Treatment Effects using Random Forests

被引:800
作者
Wager, Stefan [1 ]
Athey, Susan [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
关键词
Adaptive nearest neighbors matching; Asymptotic normality; Potential outcomes; Unconfoundedness; PROPENSITY SCORE ESTIMATION; VALID POST-SELECTION; SUBGROUP ANALYSIS; CONFIDENCE-INTERVALS; NONPARAMETRIC-TESTS; REGRESSION; JACKKNIFE; SUPPORT;
D O I
10.1080/01621459.2017.1319839
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Many scientific and engineering challengesranging from personalized medicine to customized marketing recommendationsrequire an understanding of treatment effect heterogeneity. In this article, we develop a nonparametric causal forest for estimating heterogeneous treatment effects that extends Breiman's widely used random forest algorithm. In the potential outcomes framework with unconfoundedness, we show that causal forests are pointwise consistent for the true treatment effect and have an asymptotically Gaussian and centered sampling distribution. We also discuss a practical method for constructing asymptotic confidence intervals for the true treatment effect that are centered at the causal forest estimates. Our theoretical results rely on a generic Gaussian theory for a large family of random forest algorithms. To our knowledge, this is the first set of results that allows any type of random forest, including classification and regression forests, to be used for provably valid statistical inference. In experiments, we find causal forests to be substantially more powerful than classical methods based on nearest-neighbor matching, especially in the presence of irrelevant covariates.
引用
收藏
页码:1228 / 1242
页数:15
相关论文
共 75 条
  • [1] [Anonymous], 2004, Technical report.
  • [2] [Anonymous], TECHNICAL REPORT
  • [3] [Anonymous], 2011, Proceedings of the 28th International Conference on International Conference on Machine Learning
  • [4] [Anonymous], 1999, SUBSAMPLING, DOI DOI 10.1007/978-1-4612-1554-7
  • [5] [Anonymous], 2013, FNN: Fast Nearest Neighbor Search Algorithms and Applications
  • [6] [Anonymous], 2001, MACH LEARN, DOI DOI 10.1023/A:1010933404324
  • [7] [Anonymous], THESIS
  • [8] [Anonymous], THESIS
  • [9] [Anonymous], ANN STAT
  • [10] [Anonymous], 2000, Cambridge Series on Statistical and Probablistic Mathematics