Name
Abstract | ||
|---|---|---|
A classical problem in causal inference is that of matching, where treatment units need to be matched to control units based on covariate information. In this work, we propose a method that computes high quality almost-exact matches for high-dimensional categorical datasets. This method, called FLAME (Fast Large-scale Almost Matching Exactly), learns a distance metric for matching using a hold-out training data set. In order to perform matching efficiently for large datasets, FLAME leverages techniques that are natural for query processing in the area of database management, and two implementations of FLAME are provided: the first uses SQL queries and the second uses bit-vector techniques. The algorithm starts by constructing matches of the highest quality (exact matches on all covariates), and successively eliminates variables in order to match exactly on as many variables as possible, while still maintaining interpretable high-quality matches and balance between treatment and control groups. We leverage these high quality matches to estimate conditional average treatment effects (CATEs). Our experiments show that FLAME scales to huge datasets with millions of observations where existing state-of-the-art methods fail, and that it achieves significantly better performance than other matching methods. |
Year | Venue | Keywords |
|---|---|---|
2021 | JOURNAL OF MACHINE LEARNING RESEARCH | observational studies, distance metric learning, heterogeneous treatment effects, algorithms, databases |
DocType | Volume | Issue |
Journal | 22 | 31 |
ISSN | Citations | PageRank |
1532-4435 | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tianyu Wang | 1 | 0 | 1.01 |
| Marco Morucci | 2 | 0 | 1.01 |
| M. Usaid Awan | 3 | 0 | 0.34 |
| Yameng Liu | 4 | 0 | 1.35 |
| Sudeepa Roy | 5 | 268 | 30.95 |
| cynthia rudin | 6 | 14 | 2.60 |
| Alexander Volfovsky | 7 | 0 | 0.68 |