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...
By Zhengkang Guan, Fei Wu, Kun Kuang
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.
By Ming Cai, Hisayuki Hara
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.
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).
By Mariyam Khan, Shohei Shimizu, Thong Pham
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.
By Sambit Mishra, Yingying Wang, Christine K. Johnson, Urbashi Mitra
arXiv:2503. 08245v4 Announce Type: replace Abstract: In mixed graphs, there are both directed and bidirected edges.
By Petr Ry\v{s}av\'y, Pavel Ryt\'i\v{r}, Xiaoyu He, Georgios Korpas, Jakub Mare\v{c}ek