Empirical or Invariant Risk Minimization? A Sample Complexity Perspective
Kartik Ahuja, Jun Wang, Amit Dhurandhar, Karthikeyan Shanmugam, Kush R. Varshney
Abstract
Recently, invariant risk minimization (IRM) was proposed as a promising solution to address out-of-distribution (OOD) generalization. However, it is unclear when IRM should be preferred over the widely-employed empirical risk minimization (ERM) framework. In this work, we analyze both these frameworks from the perspective of sample complexity, thus taking a firm step towards answering this important question. We find that depending on the type of data generation mechanism, the two approaches might have very different finite sample and asymptotic behavior. For example, in the covariate shift setting we see that the two approaches not only arrive at the same asymptotic solution, but also have similar finite sample behavior with no clear winner. For other distribution shifts such as those involving confounders or anti-causal variables, however, the two approaches arrive at different asymptotic solutions where IRM is guaranteed to be close to the desired OOD solutions in the finite sample regime for polynomial generative models, while ERM is biased even asymptotically. We further investigate how different factors -the number of environments, complexity of the model, and IRM penalty weight -impact the sample complexity of IRM in relation to its distance from the OOD solutions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 57cf196a-255f-4259-8e3e-e732eb9436d8Cited by top-tier papers34
- Invariance Principle Meets Information Bottleneck for Out-of-Distribution GeneralizationKartik Ahuja, Ethan Caballero, Dinghuai Zhang, Jean-Christophe Gagnon-Audet et al.NeurIPS 2021 · 372 citations
- How Neural Networks Extrapolate: From Feedforward to Graph Neural NetworksKeyulu Xu, Mozhi Zhang, Jingling Li, Simon Shaolei Du et al.ICLR 2021 · 364 citations
- Discovering Invariant Rationales for Graph Neural NetworksYingxin Wu, Xiang Wang, An Zhang, Xiangnan He et al.ICLR 2022 · 313 citations
- Model-Based Domain GeneralizationAlexander Robey, George J. Pappas, Hamed HassaniNeurIPS 2021 · 167 citations
- Causal Attention for Unbiased Visual RecognitionTan Wang, Chang Zhou, Qianru Sun, Hanwang ZhangICCV 2021 · 162 citations
Builds on4
- How Neural Networks Extrapolate: From Feedforward to Graph Neural NetworksKeyulu Xu, Mozhi Zhang, Jingling Li, Simon Shaolei Du et al.ICLR 2021 · 364 citations
- Domain Generalization Using a Mixture of Multiple Latent DomainsToshihiko Matsuura, Tatsuya HaradaAAAI 2020 · 355 citations
- Efficient Domain Generalization via Common-Specific Low-Rank DecompositionVihari Piratla, Praneeth Netrapalli, Sunita SarawagiICML 2020 · 250 citations
- Invariant RationalizationShiyu Chang, Yang Zhang, Mo Yu, Tommi S. JaakkolaICML 2020 · 232 citations
Related papers
- Bayesian Invariant Risk MinimizationYong Lin, Hanze Dong, Hao Wang, Tong ZhangCVPR 2022 · 48 citations
- The Risks of Invariant Risk MinimizationElan Rosenfeld, Pradeep Kumar Ravikumar, Andrej RisteskiICLR 2021 · 356 citations
- When Shift Happens - Confounding Is to BlameAbbavaram Gowtham Reddy, Celia Rubio-Madrigal, Rebekka Burkholz, Krikamol MuandetICLR 2026 · 5 citations
- Distribution Shift Is Key to Learning Invariant PredictionHong Zheng, Fei TengAAAI 2026
- Learning Optimal Features via Partial InvarianceMoulik Choraria, Ibtihal Ferwana, Ankur Mani, Lav R. VarshneyAAAI 2023 · 3 citations
