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:2601. 16249v3 Announce Type: replace-cross Abstract: Learning DAG structures from purely observational data remains a long-standing challenge across scientific domains.
By Vy Vo, He Zhao, Trung Le, Edwin V. Bonilla, Dinh Phung
arXiv:2602. 01483v2 Announce Type: replace-cross Abstract: We propose causal preference elicitation, a Bayesian framework for expert-in-the-loop causal discovery that actively queries local edge relations to concentrate a posterior over directed acyclic graphs (DAGs).
By Edwin V. Bonilla, He Zhao, Daniel M. Steinberg
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.
By Hazhir Aliahmadi, Irina Babayan, Greg van Anders
arXiv:2607. 08238v1 Announce Type: new Abstract: Recent algorithmic advances have made directed acyclic graph (DAG) structure learning scalable for causal discovery.
By Ryan Thompson, Matt P. Wand, Veerabhadran Baladandayuthapani
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
arXiv:2609. 18535v1 Announce Type: new Abstract: Causal discovery aims to recover causal relationships from observed data.
By Weijian Yu, Jean Honorio
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: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:2608. 03868v1 Announce Type: cross Abstract: Causal Discovery (CD) from observational data faces two fundamental challenges.
By Abhinav Thorat, Ravi Kumar Kolla, Vishak K Bhat, Harsh Vardhan Singh Chauhan, Niranjan Pedanekar
arXiv:2407. 07338v4 Announce Type: replace-cross Abstract: We study the problem of restricting a Markov equivalence class of maximal ancestral graphs (MAGs) to only those MAGs that contain certain edge marks, which we refer to as expert or orientation knowledge.
By Aparajithan Venkateswaran, Emilija Perkovi\'c
arXiv:2607. 10456v1 Announce Type: cross Abstract: Expert background knowledge is often available in practical applications of causal discovery.
By M\'aty\'as Schubert, Theofanis Aslanidis, Tom Claassen, Sara Magliacane