arXiv:2601. 16249v3 Announce Type: replace-cross Abstract: Learning DAG structures from purely observational data remains a long-standing challenge across scientific domains.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
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).
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: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...
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.
The paper introduces TS‑BOSS, a time‑series extension of the Best Order Score Search (BOSS) algorithm for causal structure learning. TS‑BOSS conducts a permutation‑based search over dynamic Bayesian network structures, using grow‑shrink trees to cache intermediate score computations, thereby maintaining scalability and strong empirical performance. The authors provide theoretical guarantees of soundness under suitable assumptions and demonstrate that TS‑BOSS achieves higher adjacency recall than standard constraint‑based methods, especially in high auto‑correlation regimes.
arXiv:2503. 08245v4 Announce Type: replace Abstract: In mixed graphs, there are both directed and bidirected edges.