A quasi-polynomial time algorithm is introduced to find the lowest-degree identifying formula for a causal effect in linear SCMs if one exists within a prespecified degree bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Symbolic Computations for Identifying Causal Effects
A quasi-polynomial time algorithm is introduced to find the lowest-degree identifying formula for a causal effect in linear SCMs if one exists within a prespecified degree bound.