aiqbench analysis
This paper introduces LinADMG, a novel framework for causal discovery in linear models with latent confounding that eliminates the need for non-Gaussianity or bow-freeness assumptions. By leveraging multi-domain identifiable representation learning, the method successfully recovers direct causal relations and full ADMG structures under specific no-cancellation conditions. The approach is validated across simulated and semisynthetic datasets using four distinct representation learning techniques.
Causal Discovery for Linear Models with Latent Confounding via Multi-domain Identifiable Representation Learning
arXiv:2610.28134v1 Announce Type: new Abstract: Causal discovery with latent confounding is particularly challenging, but a common setting in real-world data. In this work, we focus on linear causal models with latent confounding, represented by acyclic directed mixed graphs (ADMGs). Existing methods that fully identify ADMGs typically assume non-Gaussianity or graphical constraints, such as bow-freeness. In contrast, we propose Linear ADMG Learning (LinADMG), a framework for learning ADMGs for linear causal models through identifiable representation learning. Rather than relying on non-Gaussianity or bow-freeness, LinADMG leverages multi-domain settings to identify the noise variables. We show that the identifiability of the noise variables is sufficient for recovering all direct causal relations, and that, under an additional latent-confounding no-cancellation condition, LinADMG can identify the whole ADMG. We implement LinADMG with four identifiable representation learning approaches from the literature and validate the methods on simulated and semisynthetic datasets.
Abstract:Causal discovery with latent confounding is particularly challenging, but a common setting in real-world data. In this work, we focus on linear causal models with latent confounding, represented by acyclic directed mixed graphs (ADMGs). Existing methods that fully identify ADMGs typically assume non-Gaussianity or graphical constraints, such as bow-freeness. In contrast, we propose Linear ADMG Learning (LinADMG), a framework for learning ADMGs for linear causal models through identifiable representation learning. Rather than relying on non-Gaussianity or bow-freeness, LinADMG leverages multi-domain settings to identify the noise variables. We show that the identifiability of the noise variables is sufficient for recovering all direct causal relations, and that, under an additional latent-confounding no-cancellation condition, LinADMG can identify the whole ADMG. We implement LinADMG with four identifiable representation learning approaches from the literature and validate the methods on simulated and semisynthetic datasets.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2610.28134 [cs.LG]
(or arXiv:2610.28134v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.28134 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 235 words
Related coverage
Same molecule, Different Knowledge: Cross-Identifier Binding Failures in LLMs For chemistry
arXiv · Oct 23, 2026
On the Identifiability of Controlled World Models
arXiv · Jul 27, 2026
Reinformed Dreamer: An Asymmetric World Model Efficiently Trained through Latent Guidance
arXiv · Jul 29, 2026
Learning User Representations to Improve Simulation Fidelity
arXiv · Oct 19, 2026