DeDiCa: A Scalable Deconfounding Discrete Causal Generative Model

arXiv:2610.23272 · cs.LG · Submitted 2026-10-16 · Read on arXiv

cs.LG

Submitted: 2026-10-16

Updated: 2026-10-16

Comments: 32 pages, 14 figures, 7 tables

License: http://creativecommons.org/licenses/by-nc-nd/4.0/

The gist: We introduce DeDiCa, a practical framework for efficient causal inference with discrete variables and hidden confounding that revisits classical probabilistic modeling through a tensorized

Terminology

Abstract

We introduce DeDiCa, a practical framework for efficient causal inference with discrete variables and hidden confounding that revisits classical probabilistic modeling through a tensorized parameterization of causal Bayesian networks, enabling tractable inference. Given a causal graph, DeDiCa is trained once on observational data by maximum likelihood, exactly marginalizing over hidden confounders, and can then estimate any (proxy-)identifiable interventional query. Despite this deliberately simple parameterization, DeDiCa matches state-of-the-art neural causal generative models in ATE estimation, while supporting memory-efficient CPU training and exact interventional inference in milliseconds. Compared with causal foundation models, DeDiCa scales more effectively with additional observational samples and achieves competitive accuracy at substantially lower inference time and memory. DeDiCa provides a tractable, accurate, and scalable approach to causal inference in discrete settings with hidden confounding.

Related papers