MALTS: Matching After Learning to Stretch

Harsh Parikh, Cynthia Rudin and Alexander Volfovsky

Abstract: We introduce a flexible framework that produces high-quality almost-exact matches for causal inference. Most prior work in matching uses ad-hoc distance metrics, often leading to poor quality matches, particularly when there are irrelevant covariates. In this work, we learn an interpretable distance metric for matching, which leads to substantially higher quality matches. The learned distance metric stretches the covariate space according to each covariate's contribution to outcome prediction: this stretching means that mismatches on important covariates carry a larger penalty than mismatches on irrelevant covariates. Our ability to learn flexible distance metrics leads to matches that are interpretable and useful for the estimation of conditional average treatment effects.

Date: 2018-11, Revised 2023-06
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Published in Journal.of.Machine.Learning.Research 23(240) (2022) 1-42

Downloads: (external link)
http://arxiv.org/pdf/1811.07415 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1811.07415

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().