Causally Inspired Regularization Enables Domain General Representations

Olawale Salaudeen, Sanmi Koyejo
4/25/2024
cs.LGstat.ML

No official code found. Best implementation: olawalesalaudeen/tcri (1 star, MIT, last commit 2024-12-27).

Abstract

Given a causal graph representing the data-generating process shared across different domains/distributions, enforcing sufficient graph-implied conditional independencies can identify domain-general (non-spurious) feature representations. For the standard input-output predictive setting, we categorize the set of graphs considered in the literature into two distinct groups: (i) those in which the empirical risk minimizer across training domains gives domain-general representations and (ii) those where it does not. For the latter case (ii), we propose a novel framework with regularizations, which we demonstrate are sufficient for identifying domain-general feature representations without a priori knowledge (or proxies) of the spurious features. Empirically, our proposed method is effective for both (semi) synthetic and real-world data, outperforming other state-of-the-art methods in average and worst-domain transfer accuracy.

View on arXivView PDF

Code Implementations(1)

MIT
11PythonFeb 29, 20241 years agoMIT

Similar Papers

Cite this paper

@article{salaudeen2024causally,
  title  = {Causally Inspired Regularization Enables Domain General Representations},
  author = {Olawale Salaudeen and Sanmi Koyejo},
  year   = {2024},
  eprint = {2404.16277},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.16277v1}
}

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/2404.16277.svg)](https://codeofpaper.com/paper/2404.16277)

Discussion