Propensity Score Matching - Balancing Theorem and Failure Modes

Summary

Propensity score matching (PSM) exploits the Rosenbaum-Rubin balancing theorem: conditioning on is sufficient to achieve covariate balance between treatment groups, reducing a high-dimensional adjustment problem to a one-dimensional one. PSM estimates the Average Treatment Effect on the Treated (ATT) by pairing each treated unit with a control unit of similar propensity score, then comparing outcomes within matched pairs. It is a design method — not a regression method — and its validity is assessed through balance diagnostics, not hypothesis tests.

Overview

When randomisation is impossible, causal identification under the selection-on-observables assumption requires that treatment assignment be as-good-as-random conditional on a set of measured pre-treatment covariates :

See Conditional Independence Assumption for the formal statement. The challenge is that may be high-dimensional, making direct adjustment — conditioning on all of simultaneously — difficult. Propensity score matching addresses this through dimensionality reduction.

The three frequentist strategies for exploiting ignorability — outcome modelling, inverse probability weighting (IPW), and doubly-robust estimation — are surveyed in Frequentist Causal Estimation. PSM is a fourth, closely related strategy: it finds a matched control group that is directly comparable to the treated group without specifying a parametric outcome model.

The Propensity Score

Definition: Propensity Score (Rosenbaum & Rubin 1983)

The propensity score is the conditional probability of receiving treatment given pre-treatment covariates:

In practice, is unknown and must be estimated, typically via logistic regression:

Using the estimated propensity score has a counterintuitive property: Hirano, Imbens & Ridder (2003) show that the estimated achieves better finite-sample balance than the true , because the estimation step incorporates sample information.

The Balancing Theorem

Theorem: Propensity Score Balancing (Rosenbaum & Rubin 1983, Theorem 1)

If treatment assignment is strongly ignorable given :

then:

  1. Identification holds given only :
  2. The propensity score is a balancing score:

The second property is the key dimensionality-reduction result: within strata of equal propensity score, the covariate distribution is the same in treatment and control groups — regardless of the dimension of .

Why this is powerful: Instead of conditioning on all of simultaneously (which may require many cells or a parametric model), it is sufficient to condition on the single scalar . This converts a -dimensional problem into a 1-dimensional one.

The identification consequence: Under strong ignorability,

so ATT is identified by comparing outcomes within propensity-score strata.

Required Assumptions

Propensity score matching requires two conditions:

Definition: Strong Ignorability (Rosenbaum & Rubin 1983)

Treatment assignment is strongly ignorable given if:

  1. Unconfoundedness (CIA): — no unobserved confounders
  2. Overlap (common support): for all in the support of

Unconfoundedness is the key untestable assumption: all variables that jointly affect treatment and outcome must be observed and included in . If an unobserved variable confounds the relationship, PSM does not recover the causal effect — see The Selection Problem for why this is hard and Activity Bias in Advertising for a case where it fails.

Overlap ensures that every treated unit has a potential match in the control pool. When overlap fails, matching implicitly extrapolates — units in regions of poor overlap are dropped or matched to distant controls.

What PSM Estimates: ATT, Not ATE

PSM most naturally estimates the Average Treatment Effect on the Treated (ATT):

because the control group is constructed to be the counterfactual for treated units. The ATE:

requires that both treated and untreated units have matches — harder to satisfy when overlap is limited. For ATE, IPW is often preferred. See ^def-ipw.

PSM vs IPW: Conceptual Differences

DimensionPSMIPW
What it doesSelects a matched control sampleReweights the full sample
Unit disposalDiscards unmatched units (controls and sometimes treated)Uses all units (with extreme weights for low-overlap units)
EstimandATT (naturally)ATE or ATT (with weight normalisation)
Sensitivity to extreme PSCaliper prevents extreme PS pairsExtreme weights inflate variance; trimming needed
Sample size after adjustmentReduced (matched sample only)Same size; effective reduced by variance of weights
Primary diagnosticCovariate balance in matched sampleDistribution of weights; effective sample size

Both are consistent under correct PS model specification; doubly-robust estimators (see ^def-dr) combine the two for robustness.

Why PSM Fails: The Activity Bias Case

Activity Bias in Advertising demonstrates the limits of PSM: when treatment assignment is driven by an unobserved time-varying covariate (user activity level that simultaneously predicts ad exposure and purchase propensity), PSM cannot balance on the key confounder because it is not measured. The observed does not satisfy unconfoundedness, so the balancing theorem does not apply.

The diagnostic signature: after matching, remaining SMD for observed covariates may be small, but causal estimates remain biased because . No amount of matching sophistication repairs a violated unconfoundedness assumption.

The PSM Workflow

  1. Specify the DAG to identify the adjustment set (see DAGs and Causal Identification)
  2. Estimate the propensity score: fit logistic regression ; extract
  3. Match: pair treated and control units using — see Matching Algorithms and Caliper
  4. Assess balance: check covariate balance in the matched sample — see Covariate Balance and Matching Diagnostics
  5. Iterate: if balance is poor, adjust the PS model (add interactions, polynomials) or change the matching algorithm
  6. Estimate ATT: compare outcomes in the matched sample using regression (including covariates reduces variance and corrects for residual imbalance)

PSM as Preprocessing

Ho, Imai, King & Stuart (2007) reframe PSM as nonparametric preprocessing — it reduces model dependence of the subsequent regression step. After matching, the outcome model is estimated in a balanced sample where regression extrapolation is minimal.

Connections

See Also