Roadblocks for Temporarily Disabling Shortcuts and Learning New Knowledge
Hongjing Niu, Hanting Li, Feng Zhao, Bin Li
摘要
Deep learning models have been found with a tendency of relying on shortcuts, i.e., decision rules that perform well on standard benchmarks but fail when transferred to more challenging testing conditions. Such reliance may hinder deep learning models from learning other task-related features and seriously affect their performance and robustness. Although recent studies have shown some characteristics of shortcuts, there are few investigations on how to help the deep learning models to solve shortcut problems. This paper proposes a framework to address this issue by setting up roadblocks on shortcuts. Specifically, roadblocks are placed when the model is urged to learn to complete a gently modified task to ensure that the learned knowledge, including shortcuts, is insufficient the complete the task. Therefore, the model trained on the modified task will no longer over-rely on shortcuts. Extensive experiments demonstrate that the proposed framework significantly improves the training of networks on both synthetic and real-world datasets in terms of both classification accuracy and feature diversity. Moreover, the visualization results show that the mechanism behind the proposed our method is consistent with our expectations. In summary, our approach can effectively disable the shortcuts and thus learn more robust features.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Overcoming Simplicity Bias in Deep Networks using a Feature SieveRishabh Tiwari, Pradeep ShenoyICML 2023 · 被引用 32 次
- Do ImageNet-trained Models Learn Shortcuts? The Impact of Frequency Shortcuts on GeneralizationShunxin Wang, Raymond N. J. Veldhuis, Nicola StrisciuglioCVPR 2025
它引用的顶会 Paper12
- Distributionally Robust Neural NetworksShiori Sagawa, Pang Wei Koh, Tatsunori B. Hashimoto, Percy LiangICLR 2020 · 被引用 1,578 次
- Just Train Twice: Improving Group Robustness without Training Group InformationEvan Zheran Liu, Behzad Haghgoo, Annie S. Chen, Aditi Raghunathan 等ICML 2021 · 被引用 683 次
- The Pitfalls of Simplicity Bias in Neural NetworksHarshay Shah, Kaustav Tamuly, Aditi Raghunathan, Prateek Jain 等NeurIPS 2020 · 被引用 503 次
- Learning from Failure: De-biasing Classifier from Biased ClassifierJun Hyun Nam, Hyuntak Cha, Sungsoo Ahn, Jaeho Lee 等NeurIPS 2020 · 被引用 428 次
- The Origins and Prevalence of Texture Bias in Convolutional Neural NetworksKatherine L. Hermann, Ting Chen, Simon KornblithNeurIPS 2020 · 被引用 369 次
相关 Paper
- Efficient Unsupervised Shortcut Learning Detection and Mitigation in TransformersLukas Kuhn, Sari Sadiya, Jörg Schlötterer, Florian Buettner 等ICCV 2025 · 被引用 1 次
- Causally motivated multi-shortcut identification and removalJiayun Zheng, Maggie MakarNeurIPS 2022 · 被引用 27 次
- Learning Concept Credible Models for Mitigating ShortcutsJiaxuan Wang, Sarah Jabbour, Maggie Makar, Michael W. Sjoding 等NeurIPS 2022 · 被引用 8 次
- Improving the robustness of NLI models with minimax trainingMichalis Korakakis, Andreas VlachosACL 2023 · 被引用 4 次
- Catch-Up Mix: Catch-Up Class for Struggling Filters in CNNMinsoo Kang, Minkoo Kang, Suhyun KimAAAI 2024 · 被引用 7 次
