arXiv Statistics ML
Discrete Score Matching Enables Causal Discovery from Count Data
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Sep 18
Epidemiological Causal Graph Identification: Challenges, Identifiability and Algorithms
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.
arXiv Machine Learning
Sep 10
Causal DAG Identification for Count Data via Poisson Thinning Structural Equation Models
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...
arXiv Machine Learning
Jun 24
GRACE: Gated Refinement for Accurate Causal Edge Discovery in High-Dimensional Time Series
arXiv:2606. 23880v1 Announce Type: new Abstract: From climate teleconnections to gene regulation, modern time-series datasets encompass tens or hundreds of interacting variables, making causal discovery increasingly challenging.
arXiv AI
Jul 28
Ordering-based Causal Discovery via Generalized Score Matching
arXiv:2601. 16249v3 Announce Type: replace-cross Abstract: Learning DAG structures from purely observational data remains a long-standing challenge across scientific domains.
arXiv Statistics ML
3d ago
MARCEDES: Score-based causal discovery under non-Gaussianity with continuous optimization
arXiv:2609.30643v1 Announce Type: new Abstract: We consider the problem of learning the underlying causal directed acyclic graph (DAG) structure corresponding to a structural equation model (SEM) wit...
Hugging Face Trending Papers
Jul 7
Learning Sparsest Linear Causal DAGs with Latent Confounders via Higher-Order Cumulants
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.