Causal Discovery for Linear Non-Gaussian Models with Disjoint Cycles
- URL: http://arxiv.org/abs/2507.10767v1
- Date: Mon, 14 Jul 2025 19:45:23 GMT
- Title: Causal Discovery for Linear Non-Gaussian Models with Disjoint Cycles
- Authors: Mathias Drton, Marina Garrote-López, Niko Nikov, Elina Robeva, Y. Samuel Wang,
- Abstract summary: We develop an algorithm for learning causal structures with disjoint cycles.<n>We show that simple quadratic and cubic relations among low-order moments of a non-Gaussian distribution allow one to locate source cycles.
- Score: 3.425341633647624
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The paradigm of linear structural equation modeling readily allows one to incorporate causal feedback loops in the model specification. These appear as directed cycles in the common graphical representation of the models. However, the presence of cycles entails difficulties such as the fact that models need no longer be characterized by conditional independence relations. As a result, learning cyclic causal structures remains a challenging problem. In this paper, we offer new insights on this problem in the context of linear non-Gaussian models. First, we precisely characterize when two directed graphs determine the same linear non-Gaussian model. Next, we take up a setting of cycle-disjoint graphs, for which we are able to show that simple quadratic and cubic polynomial relations among low-order moments of a non-Gaussian distribution allow one to locate source cycles. Complementing this with a strategy of decorrelating cycles and multivariate regression allows one to infer a block-topological order among the directed cycles, which leads to a {consistent and computationally efficient algorithm} for learning causal structures with disjoint cycles.
Related papers
- Flow-Based Non-stationary Temporal Regime Causal Structure Learning [49.77103348208835]
We introduce FANTOM, a unified framework for causal discovery.<n>It handles non stationary processes along with non Gaussian and heteroscedastic noises.<n>It simultaneously infers the number of regimes and their corresponding indices and learns each regime's Directed Acyclic Graph.
arXiv Detail & Related papers (2025-06-20T15:12:43Z) - Simple and Critical Iterative Denoising: A Recasting of Discrete Diffusion in Graph Generation [0.0]
dependencies between intermediate noisy states lead to error accumulation and propagation during the reverse denoising process.<n>We propose a novel framework called Simple Iterative Denoising, which simplifies discrete diffusion and circumvents the issue.<n>Our empirical evaluations demonstrate that the proposed method significantly outperforms existing discrete diffusion baselines in graph generation tasks.
arXiv Detail & Related papers (2025-03-27T15:08:58Z) - Cyclic quantum causal modelling with a graph separation theorem [0.0]
We introduce a robust probability rule and a novel graph-separation property, p-separation, which we prove to be sound and complete for all such models.<n>Our approach maps cyclic causal models to acyclic ones with post-selection, leveraging the post-selected quantum teleportation protocol.
arXiv Detail & Related papers (2025-02-06T15:51:15Z) - Induced Covariance for Causal Discovery in Linear Sparse Structures [55.2480439325792]
Causal models seek to unravel the cause-effect relationships among variables from observed data.
This paper introduces a novel causal discovery algorithm designed for settings in which variables exhibit linearly sparse relationships.
arXiv Detail & Related papers (2024-10-02T04:01:38Z) - Kernel-Based Differentiable Learning of Non-Parametric Directed Acyclic Graphical Models [17.52142371968811]
Causal discovery amounts to learning a directed acyclic graph (DAG) that encodes a causal model.
Recent research has sought to bypass the search by reformulating causal discovery as a continuous optimization problem.
arXiv Detail & Related papers (2024-08-20T16:09:40Z) - Bayesian Circular Regression with von Mises Quasi-Processes [57.88921637944379]
In this work we explore a family of expressive and interpretable distributions over circle-valued random functions.<n>For posterior inference, we introduce a new Stratonovich-like augmentation that lends itself to fast Gibbs sampling.<n>We present experiments applying this model to the prediction of wind directions and the percentage of the running gait cycle as a function of joint angles.
arXiv Detail & Related papers (2024-06-19T01:57:21Z) - Causal Modeling with Stationary Diffusions [89.94899196106223]
We learn differential equations whose stationary densities model a system's behavior under interventions.
We show that they generalize to unseen interventions on their variables, often better than classical approaches.
Our inference method is based on a new theoretical result that expresses a stationarity condition on the diffusion's generator in a reproducing kernel Hilbert space.
arXiv Detail & Related papers (2023-10-26T14:01:17Z) - Learning Graphical Factor Models with Riemannian Optimization [70.13748170371889]
This paper proposes a flexible algorithmic framework for graph learning under low-rank structural constraints.
The problem is expressed as penalized maximum likelihood estimation of an elliptical distribution.
We leverage geometries of positive definite matrices and positive semi-definite matrices of fixed rank that are well suited to elliptical models.
arXiv Detail & Related papers (2022-10-21T13:19:45Z) - Learning Relational Causal Models with Cycles through Relational
Acyclification [16.10327013845982]
We introduce textitrelational acyclification, an operation specifically designed for relational models.
We show that under the assumptions of relational acyclification and $sigma$-faithfulness, the relational causal discovery algorithm RCD is sound and complete for cyclic models.
arXiv Detail & Related papers (2022-08-25T17:00:42Z) - Score-based Generative Modeling of Graphs via the System of Stochastic
Differential Equations [57.15855198512551]
We propose a novel score-based generative model for graphs with a continuous-time framework.
We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
arXiv Detail & Related papers (2022-02-05T08:21:04Z) - Learning Linear Non-Gaussian Graphical Models with Multidirected Edges [8.71151886950158]
We propose a new method to learn the underlying acyclic mixed graph of a linear non-Gaussian structural equation model given observational data.
We show that one can augment the hidden variable structure of the recovered model by learning em multidirected edges rather than only directed and bidirected ones.
arXiv Detail & Related papers (2020-10-11T18:10:15Z) - Structure Learning for Cyclic Linear Causal Models [5.567377163246147]
We consider the problem of structure learning for linear causal models based on observational data.
We treat models given by possibly cyclic mixed graphs, which allow for feedback loops and effects of latent confounders.
arXiv Detail & Related papers (2020-06-10T17:47:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.