2019
DOI: 10.1353/obs.2019.0006
|View full text |Cite
|
Sign up to set email alerts
|

An Application of Matching After Learning To Stretch (MALTS) to the ACIC 2018 Causal Inference Challenge Data

Abstract: In the learning-to-match framework for causal inference, a parameterized distance metric is trained on a holdout train set so that the matching yields accurate estimated conditional average treatment effects. This way, the matching can be as accurate as other black box machine learning techniques for causal inference. We use a new learning-to-match algorithm called Matching-After-Learning-To-Stretch (MALTS) (Parikh et al., 2018) to study an observational dataset from the Atlantic Causal Inference Challenge. O… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
3

Relationship

4
4

Authors

Journals

citations
Cited by 8 publications
(14 citation statements)
references
References 1 publication
0
14
0
Order By: Relevance
“…Here treatment units are matched to similar control units to estimate treatment effects. We refer readers to recent work on this topic for more details Parikh et al, 2019).…”
Section: Modern Case-based Reasoningmentioning
confidence: 99%
“…Here treatment units are matched to similar control units to estimate treatment effects. We refer readers to recent work on this topic for more details Parikh et al, 2019).…”
Section: Modern Case-based Reasoningmentioning
confidence: 99%
“…These projections can be sensitive to modeling choices that affect the accuracy of the treatment effect estimates [Kreif et al, 2016]. Further, the units within a matched group can be far from each other in covariate space -i.e., the matched groups are generally not auditable [Parikh et al, 2022b]. To date, the only observational causal inference techniques that attempt to optimize accuracy while maintaining auditability are those stemming from the almost-matchingexactly (AME) framework, namely optimal matching (optMatch) [Yu et al, 2021, Kallus, 2017, genetic matching (GenMatch) [Diamond and Sekhon, 2013], FLAME/DAME [Wang et al, 2017, Dieng et al, 2019, MALTS [Parikh et al, 2022b[Parikh et al, , 2019[Parikh et al, , 2022a and AHB [Morucci et al, 2020] algorithms.…”
Section: Background and Assumptionsmentioning
confidence: 99%
“…Existing almost-matching-exactly methods learn covariate weights and/or create match groups through computationally expensive and data hungry optimization algorithms. In this section we compare LCM to MALTS [ Parikh et al, 2022b], GenMatch [Diamond and Sekhon, 2013], and AHB [Morucci et al, 2020] in regards to scalability in runtime and in CATE estimation accuracy. We omit FLAME/DAME [Wang et al, 2017, Dieng et al, 2019 from this comparison since it can only handle discrete covariates.…”
Section: Scalabilitymentioning
confidence: 99%
See 1 more Smart Citation
“…These matched groups are used to estimate heterogeneous causal effects with high accuracy. Previous work on MALTS shows that it performs on-par with contemporary black-box causal machine learning methods while also ensuring interpretability (Parikh et al, 2020(Parikh et al, , 2019.…”
Section: Interpretable-and-accurate Causal Inferencementioning
confidence: 99%