LGCVMLOct 20, 2022

On Feature Learning in the Presence of Spurious Correlations

OpenAI
arXiv:2210.11369v1191 citationsh-index: 61Has Code
Originality Incremental advance
AI Analysis

This work addresses the problem of spurious correlations in deep learning for researchers and practitioners, showing incremental improvements in feature learning and robustness.

The paper evaluates how much information about core features can be decoded from representations learned by standard and specialized training methods in the presence of spurious correlations, finding that simple empirical risk minimization is highly competitive and that design choices like architecture and pre-training significantly affect feature quality, leading to improved worst-group accuracies of 97%, 92%, and 50% on benchmark datasets.

Deep classifiers are known to rely on spurious features $\unicode{x2013}$ patterns which are correlated with the target on the training data but not inherently relevant to the learning problem, such as the image backgrounds when classifying the foregrounds. In this paper we evaluate the amount of information about the core (non-spurious) features that can be decoded from the representations learned by standard empirical risk minimization (ERM) and specialized group robustness training. Following recent work on Deep Feature Reweighting (DFR), we evaluate the feature representations by re-training the last layer of the model on a held-out set where the spurious correlation is broken. On multiple vision and NLP problems, we show that the features learned by simple ERM are highly competitive with the features learned by specialized group robustness methods targeted at reducing the effect of spurious correlations. Moreover, we show that the quality of learned feature representations is greatly affected by the design decisions beyond the training method, such as the model architecture and pre-training strategy. On the other hand, we find that strong regularization is not necessary for learning high quality feature representations. Finally, using insights from our analysis, we significantly improve upon the best results reported in the literature on the popular Waterbirds, CelebA hair color prediction and WILDS-FMOW problems, achieving 97%, 92% and 50% worst-group accuracies, respectively.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes