On Measuring Localization of Shortcuts in Deep Networks
Not on the map. Why?
Abstract (arXiv)
Shortcuts, spurious rules that perform well during training but fail to generalize, present a major challenge to the reliability of deep networks (Geirhos et al., 2020). However, the impact of shortcuts on feature representations remains understudied, obstructing the design of principled shortcut-mitigation methods. To overcome this limitation, we investigate the layer-wise localization of shortcuts in deep models. Our novel experiment design quantifies the layer-wise contribution to accuracy degradation caused by a shortcut-inducing skew by counterfactual training on clean and skewed datasets. We employ our design to study shortcuts on CIFAR-10, Waterbirds, and CelebA datasets across VGG, ResNet, DeiT, and ConvNeXt architectures. We find that shortcut learning is not localized in specific layers but distributed throughout the network. Different network parts play different roles in this process: shallow layers predominantly encode spurious features, while deeper layers predominantly forget core features that are predictive on clean data. We also analyze the differences in localization and describe its principal axes of variation. Finally, our analysis of layer-wise shortcut-mitigation strategies suggests the hardness of designing general methods, supporting dataset- and architecture-specific approaches instead.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 43 references that are in the map. First posted on arXiv 30 Oct 2025.
Builds on
29 of 43 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2022A ConvNet for the 2020scited by 3,545
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
- 2020Shortcut Learning in Deep Neural Networkscited by 1,928
- 2019Invariant Risk Minimizationcited by 1,832
- 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 722
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 379
- 2020The Pitfalls of Simplicity Bias in Neural Networkscited by 349
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
17 more
- 2020The large learning rate phase of deep learning: the catapult mechanismcited by 206
- 2022Surgical Fine-Tuning Improves Adaptation to Distribution Shiftscited by 205
- 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
- 2021The Low-Rank Simplicity Bias in Deep Networkscited by 150
- 2020Understanding the Failure Modes of Out-of-Distribution Generalizationcited by 146
- 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
- 2020What shapes feature representations? Exploring datasets, architectures, and trainingcited by 125
- 2019Are All Layers Created Equal?cited by 94
- 2023Can Neural Network Memorization Be Localized?cited by 66
- 2021Which Shortcut Cues Will DNNs Choose? A Study from the Parameter-Space Perspectivecited by 56
- 2021Shape or Texture: Understanding Discriminative Features in CNNscited by 52
- 2023Don't blame Dataset Shift! Shortcut Learning due to Gradients and Cross Entropycited by 30
- 2023Understanding Why ViT Trains Badly on Small Datasets: An Intuitive Perspectivecited by 28
- 2023What do neural networks learn in image classification? A frequency shortcut perspectivecited by 28
- 2022Why does Throwing Away Data Improve Worst-Group Error?cited by 22
- 2023A Closer Look at Model Adaptation using Feature Distortion and Simplicity Biascited by 20
- 2024Simplicity Bias of Two-Layer Networks beyond Linearly Separable Datacited by 11
Built on by
Citing papers per year: 2025: 1.
1 paper.