DAGAF: A directed acyclic generative adversarial framework for joint structure learning and tabular data synthesis

arXiv cs.LG / 4/7/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces DAGAF, a directed acyclic generative adversarial framework that jointly performs causal structure learning and tabular data synthesis.
  • Instead of relying on a single identifiable causal model, DAGAF supports multiple functional causal models—such as ANM, LiNGAM, and Post-Nonlinear (PNL)—to learn a DAG that explains observed dependencies.
  • The method uses a dual-step objective with multiple loss terms, and includes theoretical analysis to justify how these losses enable both structure learning and data generation.
  • Experiments on real-world and benchmark datasets report improved causal discovery quality, measured by lower Structural Hamming Distance (SHD), along with the ability to generate diverse, high-quality synthetic tabular samples.

Abstract

Understanding the causal relationships between data variables can provide crucial insights into the construction of tabular datasets. Most existing causality learning methods typically focus on applying a single identifiable causal model, such as the Additive Noise Model (ANM) or the Linear non-Gaussian Acyclic Model (LiNGAM), to discover the dependencies exhibited in observational data. We improve on this approach by introducing a novel dual-step framework capable of performing both causal structure learning and tabular data synthesis under multiple causal model assumptions. Our approach uses Directed Acyclic Graphs (DAG) to represent causal relationships among data variables. By applying various functional causal models including ANM, LiNGAM and the Post-Nonlinear model (PNL), we implicitly learn the contents of DAG to simulate the generative process of observational data, effectively replicating the real data distribution. This is supported by a theoretical analysis to explain the multiple loss terms comprising the objective function of the framework. Experimental results demonstrate that DAGAF outperforms many existing methods in structure learning, achieving significantly lower Structural Hamming Distance (SHD) scores across both real-world and benchmark datasets (Sachs: 47%, Child: 11%, Hailfinder: 5%, Pathfinder: 7% improvement compared to state-of-the-art), while being able to produce diverse, high-quality samples.