Interpretable Causal Discovery via Causal-Effect Constraints
arXiv:2608. 12640v1 Announce Type: cross Abstract: Causal discovery aims to uncover the underlying causal relationships given data generated from a system.
arXiv:2602. 01483v2 Announce Type: replace-cross Abstract: We propose causal preference elicitation, a Bayesian framework for expert-in-the-loop causal discovery that actively queries local edge relations to concentrate a posterior over directed acyclic graphs (DAGs).
arXiv:2608. 12640v1 Announce Type: cross Abstract: Causal discovery aims to uncover the underlying causal relationships given data generated from a system.
arXiv:2607. 22934v1 Announce Type: cross Abstract: Learning causal graphs from interventional data is a challenging problem with broad applications.
arXiv:2606. 06440v1 Announce Type: new Abstract: Data-driven causal relationship identification is pertinent to advancing understanding of complex systems both within and beyond science.
arXiv:2608. 04930v1 Announce Type: cross Abstract: Bayesian causal discovery seeks to determine the posterior distribution of causal theories, which are interpreted as directed acyclic graphs (DAGs) that explain the observed data.
arXiv:2601.01368v2 Announce Type: replace Abstract: Score-based causal discovery in the presence of unobserved confounders requires both a consistent scoring criterion and an efficient search over gr...
arXiv:2602. 14972v2 Announce Type: replace Abstract: Estimating causal quantities traditionally relies on bespoke estimators tailored to specific assumptions.
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:2503. 08245v4 Announce Type: replace Abstract: In mixed graphs, there are both directed and bidirected edges.
arXiv:2607. 09449v1 Announce Type: new Abstract: Bayesian causal discovery is widely used for its ability to quantify epistemic uncertainty over directed acyclic graphs (DAGs) through posterior inference.
arXiv:2607. 10456v1 Announce Type: cross Abstract: Expert background knowledge is often available in practical applications of causal discovery.
The paper addresses causal discovery in Directed Acyclic Graphs where nodes are either ordinal (modeled with an ordered logit) or follow a one‑parameter exponential family distribution. It proves that the direction of edges between such nodes is identifiable for generic parameter values, extending prior Ordinal‑Poisson results. The authors also propose a score‑based exhaustive search and a masked continuous optimization method using DAGMA, and demonstrate through simulations that these approaches recover orientations that are otherwise unidentifiable under classical structural equation models.
arXiv:2606. 10607v1 Announce Type: cross Abstract: Causal discovery aims to uncover causal structures from observational data, which is crucial for real-world decision-making.