Nov 2026· Proceedings of the 35th ACM International Conference on Information and Knowledge Management· pp. 4419-4429· 0 citations· 36 references
TL;DR
Context-Aware Pruning of Edges (CAPE), a plug-in pruning module that formulates post-ordering edge pruning as local model selection, enabling CAPE to retain interaction-driven dependencies while pruning weak finite-sample edges.
Abstract
Ordering-based causal discovery decomposes DAG learning into topological order estimation and edge pruning. Existing work has focused on order estimation, while pruning often relies on component-wise additive tests that can miss parent effects expressed through co-parent context. We propose Context-Aware Pruning of Edges (CAPE), a plug-in pruning module that formulates post-ordering edge pruning as local model selection. For each candidate edge, CAPE computes the out-of-sample gain in conditional log-predictive density of the child when the candidate parent is included in the current parent context. It retains the edge only when this contextual gain exceeds an MDL-inspired adaptive structural penalty. This criterion evaluates conditional predictive evidence rather than isolated additive effects, enabling CAPE to retain interaction-driven dependencies while pruning weak finite-sample edges. Across six ordering backbones, CAPE improves SHD, SID, and F1 on synthetic nonlinear graphs and assumption-violation benchmarks, including simulated latent confounding, measurement error, post-nonlinear mechanisms, and non-i.i.d. sampling. On empirical benchmarks, CAPE lowers average SHD and SID under the same estimated orders. Its hierarchical group-pruning strategy reduces pruning time by up to 7.5 times on larger graphs. Source code is available at https://github.com/ku-milab/CAPE.
Learning a directed acyclic graph (DAG) from observational data is a challenging combinatorial problem due to the exponential growth in the number of candidate parent-set configurations. Existing exact score-based methods often require computationally intensive combinatorial search, whereas constraint-based methods can...
We study causal discovery where each node is a random function. Previous studies on this topic rely on structural assumptions, e.g., linearity or non-linearity, and distributional assumptions, e.g., Gaussianity or non-Gaussianity. In contrast, we make use of covariance operators to avoid these assumptions. Under functi...
We introduce the Active Causal Discovery Benchmark (ACDB), an SCM-grounded environment for evaluating whether LLM agents recover causal graph structure from observations and budget-constrained hard interventions. ACDB pairs a linear-Gaussian world generator with a fixed observe-intervene-submit API and a three-layer sc...
Sagar Deb, Devam Shah, Ashwanth Krishnan· arXiv.org· 3 citations
The findings of MaSCoD support structural pre-organization as an explicit design and evaluation target for omission control and motivate evaluating context construction jointly with its utilization in judgment.
Yudai Nakada, Yuichiro Nishiura, Jin Michael Splichal· arXiv.org· 0 citations
Residual-based causal discovery assumes that each variable is generated from its parents and an independent noise source. It estimates this noise and tests its independence from candidate causes. For identifiable functions such as additive-noise models (ANMs) and the broader class of location-scale noise models (LSNMs)...
Daniel Klippert, Quang Nhat Huynh, Alexander Marx· 0 citations
Exact score-based causal structure learning supports explicit structural constraints and optimisation certificates, but its branch-and-cut search can be computationally demanding. We augment exact causal structure learning methods with an upper bound on the maximum clique size of the learned undirected skeleton, enforc...
Xiaoyu He, Pavel Rytíř, Petr Rysavý et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.