mlsanityData to 13 Oct 2026

Necessary and sufficient graphical conditions for optimal adjustment sets in causal graphical models with hidden variables

arXiv 2102.10324 ↗First posted 20 Feb 2021cs.LG cs.IT math.ITcited by 16

Not on the map. Why?

Abstract (arXiv)

The problem of selecting optimal backdoor adjustment sets to estimate causal effects in graphical models with hidden and conditioned variables is addressed. Previous work has defined optimality as achieving the smallest asymptotic estimation variance and derived an optimal set for the case without hidden variables. For the case with hidden variables there can be settings where no optimal set exists and currently only a sufficient graphical optimality criterion of limited applicability has been derived. In the present work optimality is characterized as maximizing a certain adjustment information which allows to derive a necessary and sufficient graphical criterion for the existence of an optimal adjustment set and a definition and algorithm to construct it. Further, the optimal set is valid if and only if a valid adjustment set exists and has higher (or equal) adjustment information than the Adjust-set proposed in Perkovi'c et al. [Journal of Machine Learning Research, 18: 1--62, 2018] for any graph. The results translate to minimal asymptotic estimation variance for a class of estimators whose asymptotic variance follows a certain information-theoretic relation. Numerical experiments indicate that the asymptotic results also hold for relatively small sample sizes and that the optimal adjustment set or minimized variants thereof often yield better variance also beyond that estimator class. Surprisingly, among the randomly created setups more than 90% fulfill the optimality conditions indicating that also in many real-world scenarios graphical optimality may hold. Code is available as part of the python package urlhttps://github.com/jakobrunge/tigramite.

Key facts. Cited by 16 papers in the map (data through 13 Oct 2026). Builds on 4 of its 26 references that are in the map. First posted on arXiv 20 Feb 2021.

Builds on

4 of 26 references.

References · 4

  1. 2018Separators and Adjustment Sets in Causal Graphs: Complete Criteria and an Algorithmic Frameworkcited by 16
  2. 2020Efficient adjustment sets in causal graphical models with hidden variablescited by 13
  3. 2013Markovian acyclic directed mixed graphs for discrete datacited by 10
  4. 2019Efficient adjustment sets for population average treatment effect estimation in non-parametric causal graphical modelscited by 7

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2022: 2; 2023: 5; 2024: 6; 2025: 1; 2026: 2.

16 papers.

Sort:

Similar, not cited

Close in wording, no citation either way

  1. 2025Causal Bandit Over Unknown Graphs: Upper Confidence Bounds With Backdoor Adjustment
  2. 2022Partial Identification with Noisy Covariates: A Robust Optimization Approach
  3. 2025An introduction to Causal Modelling
  4. 2025Transportability without Graphs: A Bayesian Approach to Identifying s-Admissible Backdoor Sets
  5. 2023High Dimensional Causal Inference with Variational Backdoor Adjustment
  6. 2025Identifiability by common backdoor in summary causal graphs of time series
  7. 2023Designing Discontinuities
  8. 2026Symmetries and Causality: Causal Effect Identification Beyond IID Data