Epidemiological Causal Graph Identification: Challenges, Identifiability and Algorithms
Read the original on arXiv Machine Learning →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.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.