Learning Optimal Features via Partial Invariance

Moulik Choraria, Ibtihal Ferwana, Ankur Mani, Lav R. Varshney
1/28/2023
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

Learning models that are robust to distribution shifts is a key concern in the context of their real-life applicability. Invariant Risk Minimization (IRM) is a popular framework that aims to learn robust models from multiple environments. The success of IRM requires an important assumption: the underlying causal mechanisms/features remain invariant across environments. When not satisfied, we show that IRM can over-constrain the predictor and to remedy this, we propose a relaxation via $\textit{partial invariance}$. In this work, we theoretically highlight the sub-optimality of IRM and then demonstrate how learning from a partition of training domains can help improve invariant models. Several experiments, conducted both in linear settings as well as with deep neural networks on tasks over both language and image data, allow us to verify our conclusions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{choraria2023learning,
  title  = {Learning Optimal Features via Partial Invariance},
  author = {Moulik Choraria and Ibtihal Ferwana and Ankur Mani and Lav R. Varshney},
  year   = {2023},
  eprint = {2301.12067},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.12067v2}
}

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

Discussion