Tensor-based second-order causal discovery
arXiv:2606. 18074v1 Announce Type: cross Abstract: Causal discovery seeks to uncover the causal dependencies among variables.
arXiv:2606. 18074v1 Announce Type: cross Abstract: Causal discovery seeks to uncover the causal dependencies among variables.
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: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: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: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. 06440v1 Announce Type: new Abstract: Data-driven causal relationship identification is pertinent to advancing understanding of complex systems both within and beyond science.
The paper introduces a method for learning causal structures in linear Gaussian models that may contain directed cycles and an unknown number of latent confounders, bounded by a maximum. It derives the covariance of observed variables, defines marginal quasi-equivalence to identify when different models produce the same observational distributions, and formulates structure learning as a minimization of Gaussian negative log-likelihood with a complexity penalty counting edges and latent variables. Using Bernoulli gates to parameterize edge and latent inclusion, the authors obtain a closed‑form differentiable objective whose expected value shares the same global optimum as the discrete problem, and demonstrate experimentally that this approach yields lower recovery error than prior methods.
arXiv:2607. 05984v1 Announce Type: new Abstract: Recovering the exact directed acyclic graph (DAG) in linear non-Gaussian acyclic models with latent confounders (LvLiNGAM) remains a challenging problem.
arXiv:2607. 11508v1 Announce Type: cross Abstract: Causal discovery, the process of recovering underlying causal structures from observational data, is a fundamental pursuit across scientific disciplines.
The paper introduces a variational inference framework that jointly discovers latent clusters of variables and the causal relationships among those clusters. It models clusters with categorical distributions and graph structures with Bernoulli distributions, deriving variational lower bounds and estimation techniques for learning both cluster assignments and causal links. The method’s effectiveness is shown on synthetic and real datasets.
Recovering the exact directed acyclic graph (DAG) in linear non-Gaussian acyclic models with latent confounders (LvLiNGAM) remains a challenging problem. Although LvLiNGAM is identifiable only up to an observational equivalence class, each equivalence class is characterized by a unique sparsest DAG.
Discovering the direct causes and effects of a target variable from observational data is a fundamental problem in causal discovery, with broad applications in domains such as gene regulatory analysis and biomedical research. Existing causal discovery methods either learn a global causal structure, which incurs substantial computational cost, or assume the absence of latent variables and selection bias, assumptions that are often violated in real-world settings.