Beam-search algorithms approximate Halpern-Pearl actual causes in discrete causal models via a user-supplied oracle, with adjustable precision and polynomial expected runtime.
Title resolution pending
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
-
Searching for actual causes: Approximate algorithms with adjustable precision
Beam-search algorithms approximate Halpern-Pearl actual causes in discrete causal models via a user-supplied oracle, with adjustable precision and polynomial expected runtime.