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
The paper studies observational dominance among causal structures with latent variables, defining one structure as dominating another if it can realize all distributions that the other can over the same visible variables. It provides a full characterization of this dominance partial order for three visible variables and a partial one for four, and shows that many equivalence classes are distinguished by nontrivial inequality constraints similar to Bell or instrumental inequalities. The authors also demonstrate that constraint‑based causal discovery algorithms relying only on conditional independence are much less powerful than those incorporating nested Markov and inequality constraints.
By Marina Maciel Ansanelli, Elie Wolfe, Robert W. Spekkens
arXiv:2608. 08103v1 Announce Type: new Abstract: Smooth acyclicity constraints answer whether a weighted support is a DAG, whereas structure learning asks which support change should be made.
By Rui Wu, Zongyuan Chen, Hong Xie
arXiv:2608. 11156v1 Announce Type: cross Abstract: Conditional Independence (CI) tests are the statistical engine of constraint-based causal discovery: in algorithms such as PC (Peter-Clark) and FCI (Fast Causal Inference), skeleton pruning and key orientations follow directly from CI decisions.
By Pavel Averin, Theodoros Moysiadis, Ioannis Katakis
arXiv:2609.27256v1 Announce Type: cross
Abstract: We study causal discovery where each node is a random function. Previous studies on this topic rely on structural assumptions, e.g., linearity or non...
By Keyu Li, Ruoxu Tan
arXiv:2605. 03268v2 Announce Type: replace-cross Abstract: Here we introduce Partially Observed Structural Causal Models (POSCMs) as an extension of structural causal models (SCMs) to settings where upstream contexts co-determine both the interaction structure and downstream mechanisms on observed variables.
By Turan Orujlu, Jordan Matelsky, Martin V. Butz, Charley M. Wu, Konrad P. Kording
arXiv:2404.17763v3 Announce Type: replace-cross
Abstract: Probabilistic graphical models that encode an underlying Markov random field are fundamental building blocks of generative modeling to learn...
By Yujie Chen, Anindya Bhadra, Antik Chakraborty