|
Shortcut learning
the question Geirhos et al. (2020) gathered the cases and gave the problem its name: models trained to minimize error will use whatever features predict the labels, and if a simpler feature than the intended one does the job in the training data, they will find it. The question is how to tell, before deployment, which rule a system has learned. the findings Lapuschkin et al. (2019) used explanation methods to look inside image classifiers and found the horse case above: a well-performing model was relying in part on a source tag present on horse images in its dataset. They called such systems "Clever Hans predictors", after the horse on our oddities shelf. Zech et al. (2018) trained models on chest radiographs from several hospital systems. The models could identify which hospital an image came from, and performance on pneumonia detection dropped on data from hospitals not seen in training, consistent with the model using site-specific cues. In language, Gururangan et al. (2018) showed that natural-language inference datasets carried annotation artifacts: a classifier that saw only the hypothesis sentence, never the premise, did far better than chance. McCoy, Pavlick & Linzen (2019) built a test set to catch three such heuristics, such as assuming a hypothesis follows whenever its words all appear in the premise. Strong models failed badly on it. They named the set HANS, again after the horse. the human precedent The horse is the precedent. In 1907 Pfungst showed that Clever Hans answered arithmetic questions by reading tiny, involuntary movements of the questioner. When the questioner did not know the answer, Hans did not either. Psychology later found the same thing in people: experimenter expectancy and demand characteristics are shortcuts that participants and experimenters learn without trying. what is not settled Not every unexpected feature is a shortcut; sometimes the model has found a real signal people missed. And the explanation methods used to find shortcuts have their own failure modes. The cleanest test remains the one Pfungst used: change the conditions so the suspected cue is gone, and see whether performance survives. live debates Bugs or features? Ilyas et al. (2019) argued that adversarial examples exploit genuinely predictive but non-robust features in the data: what looks like a shortcut to us is signal to the model. Is robustness separate from accuracy? Recht et al. (2019) rebuilt an ImageNet test set and found accuracy dropped consistently; Taori et al. (2020) and Miller et al. (2021) found that, across many models, accuracy under natural shift is largely predicted by in-distribution accuracy, which leaves little "effective robustness" for most interventions to claim [paraphrase, not a quotation]. methodological critiques Benchmarks that can be solved without the task. Poliak et al. (2018) and Gururangan et al. (2018) showed that inference datasets can be partly solved from the hypothesis alone. Gardner et al. (2020) proposed contrast sets, small expert edits that change the label, to test local decision boundaries; WILDS and Hendrycks & Dietterich (2019) built shift and corruption benchmarks. Each benchmark tests the shortcuts its builders thought of. the open problem For large models trained on most of the written record, it is hard to know what was in the training data, and so hard to know which test items can be solved by recall or surface pattern. Building evaluations that only the intended skill can pass is the central difficulty of measuring machine behavior. Reading list
see also
|
![]()
rev. Oct 24 2026