Reproduce “Causal Effect Identification in Uncertain Causal Networks” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Sina Akbari, Fateme Jamshidi, Ehsan Mokhtarian, Matthew J. Vowels, Jalal Etesami, Negar Kiyavash
The authors develop methods to find an identifiable subgraph of an uncertain causal graph, where identifiability means the effect is expressible from the observational distribution. They convert edge probabilities into deletion costs and propose cubic-time heuristics for NP-complete problems. On Water, one heuristic achieved cost 0.42 and plausibility ratio 0.66; this does not establish that the selected graph is true.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.