An empirical process framework for covariate balance in causal inference

01/02/2023
by   Efrén Cruz Cortés, et al.
0

We propose a new perspective for the evaluation of matching procedures by considering the complexity of the function class they belong to. Under this perspective we provide theoretical guarantees on post-matching covariate balance through a finite sample concentration inequality. We apply this framework to coarsened exact matching as well as matching using the propensity score and suggest how to apply it to other algorithms. Simulation studies are used to evaluate the procedures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2018

Matching Algorithms for Causal Inference with Multiple Treatments

Randomized clinical trials (RCTs) are ideal for estimating causal effect...
research
12/17/2018

Matching on Generalized Propensity Scores with Continuous Exposures

Generalized propensity scores (GPS) are commonly used when estimating th...
research
03/01/2019

A Framework for Covariate Balance using Bregman Distances

A common goal in observational research is to estimate marginal causal e...
research
05/26/2019

Large Sample Properties of Matching for Balance

Matching methods are widely used for causal inference in observational s...
research
12/26/2016

Generalized Optimal Matching Methods for Causal Inference

We develop an encompassing framework for matching, covariate balancing, ...
research
02/15/2018

DeepMatch: Balancing Deep Covariate Representations for Causal Inference Using Adversarial Training

We study optimal covariate balance for causal inferences from observatio...
research
10/30/2020

Empirical or Invariant Risk Minimization? A Sample Complexity Perspective

Recently, invariant risk minimization (IRM) was proposed as a promising ...

Please sign up or login with your details

Forgot password? Click here to reset