English

Can contrastive learning avoid shortcut solutions?

Machine Learning 2021-12-21 v3

Abstract

The generalization of representations learned via contrastive learning depends crucially on what features of the data are extracted. However, we observe that the contrastive loss does not always sufficiently guide which features are extracted, a behavior that can negatively impact the performance on downstream tasks via "shortcuts", i.e., by inadvertently suppressing important predictive features. We find that feature extraction is influenced by the difficulty of the so-called instance discrimination task (i.e., the task of discriminating pairs of similar points from pairs of dissimilar ones). Although harder pairs improve the representation of some features, the improvement comes at the cost of suppressing previously well represented features. In response, we propose implicit feature modification (IFM), a method for altering positive and negative samples in order to guide contrastive models towards capturing a wider variety of predictive features. Empirically, we observe that IFM reduces feature suppression, and as a result improves performance on vision and medical imaging tasks. The code is available at: \url{https://github.com/joshr17/IFM}.

Keywords

Cite

@article{arxiv.2106.11230,
  title  = {Can contrastive learning avoid shortcut solutions?},
  author = {Joshua Robinson and Li Sun and Ke Yu and Kayhan Batmanghelich and Stefanie Jegelka and Suvrit Sra},
  journal= {arXiv preprint arXiv:2106.11230},
  year   = {2021}
}

Comments

NeurIPS 2021

R2 v1 2026-06-24T03:26:03.013Z