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:2601. 16249v3 Announce Type: replace-cross Abstract: Learning DAG structures from purely observational data remains a long-standing challenge across scientific domains.
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: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:2606. 08196v1 Announce Type: cross Abstract: We study causal discovery from observational data when some variables are hidden and the data-generating process follows a location-scale noise model (LSNM).
The paper investigates identifiability in linear parametric models where variables follow either an ordered logit or a one‑parameter exponential family distribution. It proves that the direction of every edge linking an ordinal node to an exponential‑family node can be determined from the joint distribution, provided each node has at least three categories or support points, respectively. Numerical experiments confirm that these orientations can be distinguished even when conditional independence tests cannot separate them.
arXiv:2609.27256v1 Announce Type: cross Abstract: 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...
arXiv:2503. 08245v4 Announce Type: replace Abstract: In mixed graphs, there are both directed and bidirected edges.
arXiv:2609.30643v1 Announce Type: new Abstract: We consider the problem of learning the underlying causal directed acyclic graph (DAG) structure corresponding to a structural equation model (SEM) wit...
arXiv:2606. 05636v1 Announce Type: new Abstract: Root-Cause Analysis (RCA) seeks to identify the variables responsible for abnormal system behavior in complex domains such as manufacturing, cloud computing, and healthcare.
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: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: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...