COMI: COrrect and MItigate Shortcut Learning Behavior in Deep Neural Networks
Lili Zhao, Qi Liu, Linan Yue, Wei Chen, Liyi Chen, Ruijun Sun, Chao Song
Abstract
Deep Neural Networks (DNNs), despite their notable progress across information retrieval tasks, encounter the issues of shortcut learning and struggle with poor generalization due to their reliance on spurious correlations between features and labels. Current research mainly mitigates shortcut learning behavior using augmentation and distillation techniques, but these methods could be laborious and introduce unwarranted biases. To tackle these, in this paper, we propose COMI, a novel method to COrrect and MItigate shortcut learning behavior. Inspired by the ways students solve shortcuts in educational scenarios, we aim to reduce model's reliance on shortcuts and enhance its ability to extract underlying information integrated with standard Empirical Risk Minimization (ERM). Specifically, we first design Correct Habit (CoHa) strategy to retrieve the top m challenging samples for priority training, which encourages model to rely less on shortcuts in the early training. Then, to extract more meaningful underlying information, the information derived from ERM is separated into task-relevant and task-irrelevant information, the former serves as the primary basis for model predictions, while the latter is considered non-essential. However, within task-relevant information, certain potential shortcuts contribute to overconfident predictions. To mitigate this, we design Deep Mitigation (DeMi) network with shortcut margin loss to adaptively control the feature weights of shortcuts and eliminate their influence. Besides, to counteract unknown shortcut tokens issue in NLP, we adopt locally interpretable module-LIME to help recognize shortcut tokens. Finally, extensive experiments conducted on NLP and CV tasks demonstrate the effectiveness of COMI, which can perform well on both IID and OOD samples.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Cited by top-tier papers7
- Plan-on-Graph: Self-Correcting Adaptive Planning of Large Language Model on Knowledge GraphsLiyi Chen, Panrong Tong, Zhongming Jin, Ying Sun et al.NeurIPS 2024 · 160 citations
- All Patches Matter, More Patches Better: Enhance AI-Generated Image Detection via Panoptic Patch LearningZheng Yang, Ruoxin Chen, Zhiyuan Yan, Ke-Yue Zhang et al.ICLR 2026 · 28 citations
- Do LLMs Overcome Shortcut Learning? An Evaluation of Shortcut Challenges in Large Language ModelsYu Yuan, Lili Zhao, Kai Zhang, Guangting Zheng et al.EMNLP 2024 · 4 citations
- Certification of Machine Learning Models via Directional SharpnessGefei Tan, Adrià Gascón, Sarah Meiklejohn, Mariana RaykovaUSENIX Security 2026
- Physics-informed Temporal Alignment for Auto-regressive PDE Foundation ModelsCongcong Zhu, Xiaoyan Xu, Jiayue Han, Jingrun ChenICML 2025
Related papers
- Mitigating Shortcut Learning with InterpoLated LearningMichalis Korakakis, Andreas Vlachos, Adrian WellerACL 2025
- Learning Concept Credible Models for Mitigating ShortcutsJiaxuan Wang, Sarah Jabbour, Maggie Makar, Michael W. Sjoding et al.NeurIPS 2022 · 8 citations
- Which Shortcut Solution Do Question Answering Models Prefer to Learn?Kazutoshi Shinoda, Saku Sugawara, Akiko AizawaAAAI 2023 · 10 citations
- Chroma-VAE: Mitigating Shortcut Learning with Generative ClassifiersWanqian Yang, Polina Kirichenko, Micah Goldblum, Andrew Gordon WilsonNeurIPS 2022 · 21 citations
- Roadblocks for Temporarily Disabling Shortcuts and Learning New KnowledgeHongjing Niu, Hanting Li, Feng Zhao, Bin LiNeurIPS 2022 · 9 citations
