Improving Out-of-Distribution Robustness via Selective Augmentation

Huaxiu Yao, Yu Wang, Sai Li, Linjun Zhang, Weixin Liang +2 more
1/2/2022
cs.LG

Official code: huaxiuyao/LISA (52 stars, last commit 2023-04-12).

Abstract

Machine learning algorithms typically assume that training and test examples are drawn from the same distribution. However, distribution shift is a common problem in real-world applications and can cause models to perform dramatically worse at test time. In this paper, we specifically consider the problems of subpopulation shifts (e.g., imbalanced data) and domain shifts. While prior works often seek to explicitly regularize internal representations or predictors of the model to be domain invariant, we instead aim to learn invariant predictors without restricting the model's internal representations or predictors. This leads to a simple mixup-based technique which learns invariant predictors via selective augmentation called LISA. LISA selectively interpolates samples either with the same labels but different domains or with the same domain but different labels. Empirically, we study the effectiveness of LISA on nine benchmarks ranging from subpopulation shifts to domain shifts, and we find that LISA consistently outperforms other state-of-the-art methods and leads to more invariant predictors. We further analyze a linear setting and theoretically show how LISA leads to a smaller worst-group error.

View on arXivView PDF

Code Implementations(1)

huaxiuyao/LISAOfficial100%

LISA for ICML 2022

527Shell, PythonMar 14, 20223 years ago

Similar Papers

Cite this paper

@article{yao2022improving,
  title  = {Improving Out-of-Distribution Robustness via Selective Augmentation},
  author = {Huaxiu Yao and Yu Wang and Sai Li and Linjun Zhang and Weixin Liang and James Zou and Chelsea Finn},
  year   = {2022},
  eprint = {2201.00299},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2201.00299}
}

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

Discussion