For causal structures with latent variables and a fixed node order, the paper fully determines the observational dominance order at three visible nodes and bounds it at four nodes, showing that most equivalence classes require non-CI constraints.
Dependency in DAG models with Hidden Variables
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Directed acyclic graph models with hidden variables have been much studied, particularly in view of their computational efficiency and connection with causal methods. In this paper we provide the circumstances under which it is possible for two variables to be identically equal, while all other observed variables stay jointly independent of them and mutually of each other. We find that this is possible if and only if the two variables are `densely connected'; in other words, if applications of identifiable causal interventions on the graph cannot (non-trivially) separate them. As a consequence of this, we can also allow such pairs of random variables have any bivariate joint distribution that we choose. This has implications for model search, since it suggests that we can reduce to only consider graphs in which densely connected vertices are always joined by an edge.
citation-role summary
background 1
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
The Observational Partial Order of Causal Structures with Latent Variables
For causal structures with latent variables and a fixed node order, the paper fully determines the observational dominance order at three visible nodes and bounds it at four nodes, showing that most equivalence classes require non-CI constraints.