방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 이중 강건 추정 (AIPW)× | 이질적 처리 효과 (CATE / 메타 학습기)× | 랜덤 포레스트× | |
|---|---|---|---|
| 분야≠ | 인과추론 | 인과추론 | 머신러닝 |
| 계열≠ | Regression model | Regression model | Machine learning |
| 기원 연도≠ | 2005 | 2018 | 2001 |
| 창시자≠ | Robins & Rotnitzky; Bang & Robins | Wager & Athey (causal forest); Künzel et al. (meta-learners) | Breiman, L. |
| 유형≠ | Semiparametric causal estimator | Causal machine-learning framework | Ensemble (bagging of decision trees) |
| 원전≠ | Robins, J. M. & Rotnitzky, A. (1995). Semiparametric Efficiency in Multivariate Regression Models with Missing Data. Journal of the American Statistical Association, 90(429), 122-129. DOI ↗ | Wager, S. & Athey, S. (2018). Estimation and Inference of Heterogeneous Treatment Effects using Random Forests. Journal of the American Statistical Association. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭≠ | AIPW, augmented inverse probability weighting, doubly robust estimator, Çift Gürbüz Kestirici (Augmented IPW / AIPW) | conditional average treatment effect, CATE, meta-learners, causal forest | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 관련≠ | 5 | 5 | 4 |
| 요약≠ | Doubly Robust Estimation, also called Augmented Inverse Probability Weighting (AIPW), is a semiparametric method for estimating causal treatment effects that combines an outcome regression model with a propensity (treatment) model. Developed in the work of Robins & Rotnitzky (1995) and Bang & Robins (2005), it stays consistent as long as at least one of the two models is correctly specified. | Heterogeneous Treatment Effects is a machine-learning framework that estimates how a treatment effect varies across individuals — the conditional average treatment effect (CATE). It bundles meta-learner strategies such as the T-Learner, S-Learner, X-Learner and R-Learner alongside the causal forest of Wager and Athey (2018) and Künzel et al. (2019). | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGate데이터셋 ↗ |
|
|
|