The paper formalizes distinct notions of identifiability over collections of causal diagrams and proves a hierarchy among them, leaving an open conjecture on the gap between two central notions.
Causal identification under markov equivalence: Calculus, algorithm, and completeness
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Identifiability in Causal Abstractions: A Hierarchy of Criteria
The paper formalizes distinct notions of identifiability over collections of causal diagrams and proves a hierarchy among them, leaving an open conjecture on the gap between two central notions.