Integrating Background Knowledge for Scalable Causal Discovery
arXiv:2607. 10456v1 Announce Type: cross Abstract: Expert background knowledge is often available in practical applications of causal discovery.
arXiv:2607. 10456v1 Announce Type: cross Abstract: Expert background knowledge is often available in practical applications of causal discovery.
arXiv:2605. 26759v2 Announce Type: replace Abstract: Causal discovery from time series is critical for many real-world applications, such as tracing the root causes of anomalies.
arXiv:2609.23535v1 Announce Type: new Abstract: Causal discovery from observational data is a fundamental yet challenging task in scientific research. While existing approaches are primarily based on...
arXiv:2405. 19062v2 Announce Type: replace-cross Abstract: Continuous-Time Dynamic Graphs (CTDGs) enable fine-grained modeling of evolving relational systems.
arXiv:2610.00968v1 Announce Type: cross Abstract: Causal representation learning aims to discover robust features by exploiting the causal structure underlying data generation. Existing methods requi...
arXiv:2606. 13024v1 Announce Type: cross Abstract: Granger Causal Discovery (GCD) is fundamental for analyzing temporal dependencies in complex systems.
arXiv:2602. 08629v2 Announce Type: replace Abstract: Causal discovery is essential for advancing data-driven fields such as scientific AI and data analysis, yet existing approaches face significant time- and space-efficiency bottlenecks when scaling to large graphs.
arXiv:2607. 11510v1 Announce Type: new Abstract: Causal discovery from observational tabular data remains fundamentally challenging, primarily due to the heterogeneity of underlying causal mechanisms and the high-dimensional combinatorial search space of Directed Acyclic Graphs (DAGs).
arXiv:2607. 07716v1 Announce Type: cross Abstract: Temporal graphs are ubiquitous in real-world applications and Temporal Graph Networks (TGNs) have achieved superior predictive accuracy.
The paper introduces Cluster-DAGs as a flexible prior knowledge framework to improve causal discovery. It presents two modified constraint‑based algorithms, Cluster‑PC and Cluster‑FCI, tailored for fully and partially observed data. Experiments on simulated data show that these methods outperform baseline algorithms that lack prior knowledge.
arXiv:2607. 23556v1 Announce Type: cross Abstract: Temporal graphs are increasingly used to model dynamic systems in diverse domains such as social networks, financial networks, and traffic networks.
arXiv:2606. 07525v1 Announce Type: cross Abstract: Causal graphs in text are typically populated by observable, predefined events.