Causal-Aware Generative Adversarial Networks with Reinforcement Learning
Tu Anh Hoang Nguyen, Dang Nguyen, Tri-Nhan Vo, Thuc Duy Le, Sunil Gupta

TL;DR
CA-GAN is a novel generative framework that combines causal graph extraction, a conditional Wasserstein GAN, and reinforcement learning to produce high-quality, privacy-preserving synthetic tabular data that maintains causal relationships.
Contribution
It introduces a causal-aware GAN with a reinforcement learning objective to better capture causal structures in tabular data, outperforming existing methods.
Findings
Outperforms six state-of-the-art methods across 14 datasets.
Effectively preserves causal relationships and data utility.
Provides strong privacy guarantees for enterprise use.
Abstract
The utility of tabular data for tasks ranging from model training to large-scale data analysis is often constrained by privacy concerns or regulatory hurdles. While existing data generation methods, particularly those based on Generative Adversarial Networks (GANs), have shown promise, they frequently struggle with capturing complex causal relationship, maintaining data utility, and providing provable privacy guarantees suitable for enterprise deployment. We introduce CA-GAN, a novel generative framework specifically engineered to address these challenges for real-world tabular datasets. CA-GAN utilizes a two-step approach: causal graph extraction to learn a robust, comprehensive causal relationship in the data's manifold, followed by a custom Conditional WGAN-GP (Wasserstein GAN with Gradient Penalty) that operates exclusively as per the structure of nodes in the causal graph. More…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
