CaTs and DAGs: Integrating Directed Acyclic Graphs with Transformers and Fully-Connected Neural Networks for Causally Constrained Predictions

Matthew J. Vowels, Mathieu Rochat, Sina Akbari
10/18/2024
cs.LGstat.ML

No official code found. Best implementation: matthewvowels1/Causal_Transformer (2 stars, last commit 2026-01-27).

Abstract

Artificial Neural Networks (ANNs), including fully-connected networks and transformers, are highly flexible and powerful function approximators, widely applied in fields like computer vision and natural language processing. However, their inability to inherently respect causal structures can limit their robustness, making them vulnerable to covariate shift and difficult to interpret/explain. This poses significant challenges for their reliability in real-world applications. In this paper, we introduce Causal Fully-Connected Neural Networks (CFCNs) and Causal Transformers (CaTs), two general model families designed to operate under predefined causal constraints, as specified by a Directed Acyclic Graph (DAG). These models retain the powerful function approximation abilities of traditional neural networks while adhering to the underlying structural constraints, improving robustness, reliability, and interpretability at inference time. This approach opens new avenues for deploying neural networks in more demanding, real-world scenarios where robustness and explainability is critical.

View on arXivView PDF

Code Implementations(1)

CaT - Causal Transformer

20Python, Jupyter NotebookJul 2, 20238 months ago

Similar Papers

Cite this paper

@article{vowels2024cats,
  title  = {CaTs and DAGs: Integrating Directed Acyclic Graphs with Transformers and Fully-Connected Neural Networks for Causally Constrained Predictions},
  author = {Matthew J. Vowels and Mathieu Rochat and Sina Akbari},
  year   = {2024},
  eprint = {2410.14485},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.14485v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.14485.svg)](https://codeofpaper.com/paper/2410.14485)

Discussion