Distributional Equivalence in Linear Non-Gaussian Latent-Variable Cyclic Causal Models: Characterization and Learning
Haoyue Dai, Immanuel Albrecht, Peter Spirtes, Kun Zhang

TL;DR
This paper characterizes when two linear non-Gaussian latent-variable cyclic causal models are distributionally equivalent, enabling structure-free causal discovery through a novel graphical criterion and an algorithm to identify models from data.
Contribution
It introduces the first equivalence characterization for latent-variable models without structural assumptions, advancing causal discovery methods.
Findings
Established graphical criterion for distributional equivalence.
Developed edge rank constraints as a new tool.
Created an algorithm to recover models up to equivalence.
Abstract
Causal discovery with latent variables is a fundamental task. Yet most existing methods rely on strong structural assumptions, such as enforcing specific indicator patterns for latents or restricting how they can interact with others. We argue that a core obstacle to a general, structural-assumption-free approach is the lack of an equivalence characterization: without knowing what can be identified, one generally cannot design methods for how to identify it. In this work, we aim to close this gap for linear non-Gaussian models. We establish the graphical criterion for when two graphs with arbitrary latent structure and cycles are distributionally equivalent, that is, they induce the same observed distribution set. Key to our approach is a new tool, edge rank constraints, which fills a missing piece in the toolbox for latent-variable causal discovery in even broader settings. We further…
Peer Reviews
Decision·ICLR 2026 Oral
- A local graphical notion (edge rank) that makes rank constraints easier to verify. - A full graphical characterization of distributional equivalence with latent variables and cycles. - A constructive traversal algorithm for the equivalence class with the admissible moves.
- As mentioned by the authors, the learning algorithm relies on solving the OICA problem, which, in general, is hard to solve with existing methods. That being said, the result of characterizing the equivalence class has a theoretical contribution regardless of the learning algorithm. - The evaluation mostly counts class sizes and compares to a MILP baseline for rank-realization under oracle ranks. There is no empirical test in the finite sample case.
- addresses an important open problem - provides a rigorous, elegant solution - overall well written, including helpful examples
The main weakness is the lack of immediate applicability to real problems. While the paper makes great progress on an extremely challenging problem, it remains unclear to me (and unsupported by the experiments) how useful the current implementation actually is. If the authors could provide a real-data application and show meaningful practical interpretation of the (accurately) learned equivalence class, I would change my mind about this.
- This work is the first equivalence characterization for causal models with latent variables and cycles, providing the foundation needed for future assumption-free latent causal discovery. - It introduces the edge rank constraints, a new local graphical tool complementing path-rank constraints. - It provides clean connection between algebraic rank constraints and graph operations. - The examples provided in Figure 1-3 are helpful for readers to understand the concepts.
See questions.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Advanced Causal Inference Techniques · Philosophy and History of Science
