Comparing Covariate Prioritization via Matching to Machine Learning Methods for Causal Inference using Five Empirical Applications
Luke Keele, Dylan Small

TL;DR
This paper compares covariate prioritization matching methods with machine learning approaches for causal inference across five empirical studies, finding minimal differences in their effectiveness.
Contribution
It introduces a novel comparison between matching with covariate prioritization and black box machine learning methods using real empirical applications.
Findings
Little difference in performance between methods
Matching with covariate prioritization is comparable to machine learning
Provides practical advice for researchers choosing adjustment methods
Abstract
When investigators seek to estimate causal effects, they often assume that selection into treatment is based only on observed covariates. Under this identification strategy, analysts must adjust for observed confounders. While basic regression models have long been the dominant method of statistical adjustment, more robust methods based on matching or weighting have become more common. Of late, even more flexible methods based on machine learning methods have been developed for statistical adjustment. These machine learning methods are designed to be black box methods with little input from the researcher. Recent research used a data competition to evaluate various methods of statistical adjustment and found that black box methods out performed all other methods of statistical adjustment. Matching methods with covariate prioritization are designed for direct input from substantive…
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.
