Structure Learning on Clustered Data
arXiv:2607. 08238v1 Announce Type: new Abstract: Recent algorithmic advances have made directed acyclic graph (DAG) structure learning scalable for causal discovery.
The paper introduces a variational inference framework that jointly discovers latent clusters of variables and the causal relationships among those clusters. It models clusters with categorical distributions and graph structures with Bernoulli distributions, deriving variational lower bounds and estimation techniques for learning both cluster assignments and causal links. The method’s effectiveness is shown on synthetic and real datasets.
arXiv:2607. 08238v1 Announce Type: new Abstract: Recent algorithmic advances have made directed acyclic graph (DAG) structure learning scalable for causal discovery.
arXiv:2604. 22416v2 Announce Type: replace-cross Abstract: Latent variables pose a fundamental obstacle to both causal discovery and inference.
arXiv:2608. 12640v1 Announce Type: cross Abstract: Causal discovery aims to uncover the underlying causal relationships given data generated from a system.
Neuro-Causal Factor Analysis (NCFA) reimagines traditional factor analysis by integrating causal structure learning and deep generative modeling. The method learns a directed graph linking latent and observed variables, then trains a deep generative model that respects the graph’s Markov factorization. Experiments on synthetic and real datasets show NCFA achieves lower reconstruction error than standard FA and better latent distribution recovery than a variational autoencoder, while offering a sparser architecture, reduced complexity, and causal interpretability.
arXiv:2608. 04930v1 Announce Type: cross Abstract: Bayesian causal discovery seeks to determine the posterior distribution of causal theories, which are interpreted as directed acyclic graphs (DAGs) that explain the observed data.
arXiv:2607. 11508v1 Announce Type: cross Abstract: Causal discovery, the process of recovering underlying causal structures from observational data, is a fundamental pursuit across scientific disciplines.
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.
arXiv:2607. 18883v1 Announce Type: cross Abstract: A central aim of unsupervised learning is to uncover latent factors that explain dependencies among observations.
arXiv:2607. 04447v1 Announce Type: new Abstract: Local causal discovery is a scalable alternative to global structure learning.
Discovering the direct causes and effects of a target variable from observational data is a fundamental problem in causal discovery, with broad applications in domains such as gene regulatory analysis and biomedical research. Existing causal discovery methods either learn a global causal structure, which incurs substantial computational cost, or assume the absence of latent variables and selection bias, assumptions that are often violated in real-world settings.
arXiv:2606. 06288v1 Announce Type: cross Abstract: Causal representation learning aims to infer the high-level latent causal concepts that give rise to observed low-level measurements.
The paper introduces Cluster-DAGs as a flexible prior knowledge framework to improve causal discovery. It presents two modified constraint‑based algorithms, Cluster‑PC and Cluster‑FCI, tailored for fully and partially observed data. Experiments on simulated data show that these methods outperform baseline algorithms that lack prior knowledge.