AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Query-Specific Causal Graph Pruning Under Tiered Knowledge

Yizuo Chen, Jane E. Barker

ICLR 2026 · Graph learning › Graph algorithms and clustering · approach: Continuous DAG structure learning

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
prune edges and learn partial PAGs (Algorithm 1, |Z|=0) instead of full PAGsFCITiers · Random causal graphs, 10 tiersexecution time (s): 123.04 -> 74.69Improved
prune edges and learn partial PAGs (Algorithm 1, |Z|=0) instead of full PAGsFCITiers · Random causal graphs, 5 tiersexecution time (s): 22.13 -> 11.89Improved
increase number of tiers from 5 to 10 (pruning gap) (ablation)Algorithm 1 vs FCITiers · Random causal graphsexecution time gap (s): 22.13 -> 11.89 at 5 tiers; 123.04 -> 74.69 at 10 tiersImproved
increase conditioning set size |Z| from 0 to 3 (ablation)Algorithm 1 · Random causal graphs, 10 tiersexecution time (s): 74.69 -> 99.82Hurt
use Algorithm 1 instead of FCITiers for accuracy of learned PAGFCITiers · Random causal graphs, 10 tiersarrowhead precision: 0.85 -> 0.86No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy