paper-with-me

홈 › Papers

Interpretable Almost Matching Exactly for Causal Inference

2018-06-18 · Yameng Liu, Aw Dieng, Sudeepa Roy, Cynthia Rudin, Alexander Volfovsky

We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching methods do not pass basic sanity checks: they fail when irrelevant variables are introduced, and tend to be either computationally slow or produce low-quality matches. The method proposed in this work aims to match units on a weighted Hamming distance, taking into account the relative importance of the covariates; the algorithm aims to match units on as many relevant variables as possible. To do this, the algorithm creates a hierarchy of covariate combinations on which to match (similar to downward closure), in the process solving an optimization problem for each unit in order to construct the optimal matches. The algorithm uses a single dynamic program to solve all of the optimization problems simultaneously. Notable advantages of our method over existing matching procedures are its high-quality matches, versatility in handling different data distributions that may have irrelevant variables, and ability to handle missing data by matching on as many available covariates as possible.

📄 PDF Abstract BibTeX arXiv:1806.06802

Code (3)

almostExactMatch/collapsingFLAME 공식 구현
almostexactmatch/daemr 공식 구현
Dranoxgithub/DAME

Tasks

Causal Inference

Similar Papers 제목 키워드 기반

dame-flame: A Python Library Providing Fast Interpretable Matching for Causal Inference

2021-01-06 · Neha R. Gupta, Vittorio Orlandi, Chia-Rui Chang, Tianyu Wang 외

dame-flame is a Python package for performing matching for observational causal inference on datasets containing discrete covariates. This package implements the Dynamic Almost Matching Exactly (DAME) and Fast Large-Scal…

Causal Inferencefeature selection

FLAME: A Fast Large-scale Almost Matching Exactly Approach to Causal Inference

2017-07-19 · Tianyu Wang, Marco Morucci, M. Usaid Awan, Yameng Liu 외

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-e…

Causal InferenceManagement

Interpretable Almost-Matching-Exactly With Instrumental Variables

2019-06-27 · M. Usaid Awan, Yameng Liu, Marco Morucci, Sudeepa Roy 외

Uncertainty in the estimation of the causal effect in observational studies is often due to unmeasured confounding, i.e., the presence of unobserved covariates linking treatments and outcomes. Instrumental Variables (IV)…

Almost-Matching-Exactly for Treatment Effect Estimation under Network Interference

2020-03-02 · M. Usaid Awan, Marco Morucci, Vittorio Orlandi, Sudeepa Roy 외

We propose a matching method that recovers direct treatment effects from randomized experiments where units are connected in an observed network, and units that share edges can potentially influence each others' outcomes…

MALTS: Matching After Learning to Stretch

2018-11-18 · Harsh Parikh, Cynthia Rudin, Alexander Volfovsky

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 t…

Causal Inference