The Risks of Invariant Risk Minimization
Elan Rosenfeld, Pradeep Ravikumar, Andrej Risteski

TL;DR
This paper critically analyzes Invariant Risk Minimization (IRM), revealing that it often fails to recover invariant predictors and does not outperform standard methods unless test data closely resembles training data.
Contribution
The paper provides the first formal analysis of IRM's effectiveness, identifying conditions under which it fails and demonstrating its limitations in non-linear settings.
Findings
IRM can fail to recover invariant predictors in linear models.
In non-linear regimes, IRM often does not outperform Empirical Risk Minimization.
IRM requires test data to be similar to training data to be effective.
Abstract
Invariant Causal Prediction (Peters et al., 2016) is a technique for out-of-distribution generalization which assumes that some aspects of the data distribution vary across the training set but that the underlying causal mechanisms remain constant. Recently, Arjovsky et al. (2019) proposed Invariant Risk Minimization (IRM), an objective based on this idea for learning deep, invariant features of data which are a complex function of latent variables; many alternatives have subsequently been suggested. However, formal guarantees for all of these works are severely lacking. In this paper, we present the first analysis of classification under the IRM objective--as well as these recently proposed alternatives--under a fairly natural and general model. In the linear case, we show simple conditions under which the optimal solution succeeds or, more often, fails to recover the optimal invariant…
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
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Domain Adaptation and Few-Shot Learning · Machine Learning and Data Classification
