Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index; 2 of the 24 sources its claims cite were checked for support.

A generalized back-door criterion

Open access
Maathuis, Marloes H., Colombo, Diego · 2015 · The Annals of Statistics

Abstract

We generalize Pearl’s back-door criterion for directed acyclic graphs (DAGs) to more general types of graphs that describe Markov equivalence classes of DAGs and/or allow for arbitrarily many hidden variables. We also give easily checkable necessary and sufficient graphical criteria for the existence of a set of variables that satisfies our generalized back-door criterion, when considering a single intervention and a single outcome variable. Moreover, if such a set exists, we provide an explicit set that fulfills the criterion. We illustrate the results in several examples. R-code is available in the R-package pcalg.

Overview

CoChat Summary

TL;DR

The paper generalizes Pearl’s back-door criterion from DAGs to CPDAGs, MAGs, and PAGs, allowing adjustment-based causal effect identification with hidden variables and/or only equivalence-class graphs. It also gives necessary and sufficient graphical conditions for when such an adjustment set exists for a single intervention and a single outcome, plus an explicit set when it does.

Key findings

  • The generalized back-door criterion (Definition 3.7) is sufficient for adjustment: if a set \(W\) satisfies it relative to \((X,Y)\) and \(G\), then it satisfies the adjustment criterion (Theorem 3.1).
  • For a single intervention and single outcome, there is a generalized back-door set relative to \((X,Y)\) and \(G\) iff \(Y \notin \mathrm{adj}(X, R_X)\) and \(D\text{-}\mathrm{SEP}(X,Y,R_X)\cap \mathrm{possibleDe}(X,G)=\emptyset\) (Theorem 4.1).
  • When such a set exists, \(D\text{-}\mathrm{SEP}(X,Y,R_X)\) is an explicit valid choice; for DAGs this reduces to the parent set \(pa(X,D)\), and for CPDAGs and MAGs the paper gives corresponding corollaries (Corollaries 4.1–4.3).
  • For DAGs with multiple interventions, the generalized criterion can be weaker than Pearl’s original back-door criterion; Example 1 shows \(W=\emptyset\) works for a multi-intervention setting where Pearl’s criterion fails.

Methods

  • The paper is theoretical/mathematical, developing graphical criteria for causal adjustment across DAGs, CPDAGs, MAGs, and PAGs.
  • It introduces an invariance criterion, proves it implies the adjustment criterion, and then shows the generalized back-door criterion is equivalent to that invariance criterion (Theorems 7.1 and 7.3).
  • The main existence result is proved using graph-theoretic constructions involving \(R^*\), \(R_X\), \(D\text{-}\mathrm{SEP}\), possible descendants, and m-separation; examples are used to illustrate DAG, CPDAG, MAG, and PAG cases. R code is available in the R-package `pcalg`.

Limitations

  • The paper states that its main existence result is for a single intervention variable and a single outcome variable; extending it to sets \(X\) and \(Y\) is left for future work.
  • It does not allow selection variables (“unmeasured variables that determine whether a unit is included in the sample”), only hidden/unmeasured variables.
  • Evident from the text: the generalized back-door criterion identifies only a subset of all identifiable causal effects, and the explicit set it returns is not necessarily minimal.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1214/14-aos1295

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 Edge configurations in MAGs and PAGs for a visible edge A → B ; cf. Zhang (2008a), Figure 6. Instead of the tail mark at C , one can also have an arrowhead or circle mark.
Fig. 1 Edge configurations in MAGs and PAGs for a visible edge A → B ; cf. Zhang (2008a), Figure 6. Instead of the tail mark at C , one can also have an arrowhead or circle mark.From the PDF
Fig. 2 DAG examples. (a) The DAG D for Example 1. (b) The DAG D for Example 3.
Fig. 2 DAG examples. (a) The DAG D for Example 1. (b) The DAG D for Example 3.From the PDF
Fig. 3 CPDAG examples. (a) The CPDAG C for Example 4. (b) The CPDAG C ′ for Example 5.
Fig. 3 CPDAG examples. (a) The CPDAG C for Example 4. (b) The CPDAG C ′ for Example 5.From the PDF
Fig. 4 MAG examples. (a) A possible DAG described by the MAG in Example 6, where L is latent. (b) The MAG M for Example 7.
Fig. 4 MAG examples. (a) A possible DAG described by the MAG in Example 6, where L is latent. (b) The MAG M for Example 7.From the PDF
Fig. 5 PAG example. (a) The PAG P for Example 8. (b) A possible MAG M for Example 8.
Fig. 5 PAG example. (a) The PAG P for Example 8. (b) A possible MAG M for Example 8.From the PDF

Verification

Claims the paper makes

2 Valid · 0 Not valid · 14 Not checked · 34 Own results and interpretations

24 more claims

Create a free account to see all 50 claims and to verify the 3 references still open.

See all claims — free account
  • Probably not a substantial claim. 9
  • It may state two separate claims as one. 12

Create a free account to see these claims.

Citations

Cites

Show all 31 references

Research works printed but not linked: 6

  1. Pearl, J. (2000). Causality: Models, Reasoning, and Inference. Cambridge Univ. Press, Cambridge.
  2. Pearl, J. (2009). Causality: Models, Reasoning, and Inference, 2nd ed. Cambridge Univ. Press, Cambridge.
  3. Borboudakis, G., Triantafillou, S. and Tsamardinos, I. (2012). Tools and algorithms for causally interpreting directed edges in maximal ancestral graphs. In Proceedings of the 6 th European Workshop on Probabilistic Graphical Models (PGM 2012) 35–42. DECSAI, Univ. Granada.
  4. Glymour, C., Scheines, R., Spirtes, P. and Kelly, K. (1987). Discovering Causal Structure: Artificial Intelligence, Philosophy of Science, and Statistical Modeling. Academic Press, San Diego, CA.
  5. Koller, D. and Friedman, N. (2009). Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge, MA.
  6. Zhang, J. (2006). Causal inference and reasoning in causally insufficient systems. Ph.D. thesis, Carnegie Mellon Univ., Pittsburgh, PA.

Cited by

See all 88

Metadata

Authors
Maathuis, M. H., & Colombo, D.
Venue
The Annals of Statistics
Published
2015-06-01
Volume
43
Issue
3
Pages
1060-1088
ISSN
0090-5364 (ISSN-L)
OpenAlex
W34433402
Cited by
88
References
31
Citations by year
2026: 4 · 2025: 10 · 2024: 8 · 2023: 7 · 2022: 12 · 2021: 8 · 2020: 12 · 2019: 5 · 2018: 2 · 2017: 7 · 2016: 1 · 2015: 6
FWCI
5.23
Type
journal article
Language
en
Open access
Locations
  • The Annals of Statistics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Project Euclid (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
  • Physical Sciences › Mathematics › Statistics and Probability › Advanced Causal Inference Techniques
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
Keywords
directed acyclic graphs, Markov equivalence classes, hidden variables, causal inference, graphical criteria, intervention, confounding

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A generalized back-door criterion. https://app.cochat.ai/papers/10.1214/14-aos1295
The paper
Maathuis, M. H., & Colombo, D. (2015). A generalized back-door criterion. The Annals of Statistics. https://doi.org/10.1214/14-aos1295

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.