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:2607. 23439v1 Announce Type: cross Abstract: Graphical models are ubiquitous in social and empirical science as they are intuitive and easy to use.
By Trung Phung, Ilya Shpitser
arXiv:2603. 08311v2 Announce Type: replace-cross Abstract: We study identifiability in continuous-time linear stationary stochastic differential equations with a known causal structure.
By Gijs van Seeventer, Saber Salehkaleybar
arXiv:2608.24602v1 Announce Type: cross
Abstract: Probabilistic models of Directed Acyclic Graphs (DAGs) with latent variables impose equality constraints on the observed data distribution beyond ord...
By Razieh Nabi, Anna Guo, Lin Liu
arXiv:2609.06098v1 Announce Type: cross
Abstract: Count-valued variables arise in many scientific and applied settings, yet explicit structural models that allow full identification of causal DAGs fr...
By Penggang Gao, Ming Cai, Hisayuki Hara
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