{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:17:48Z","timestamp":1777889868232,"version":"3.51.4"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iccv51701.2025.00214","type":"proceedings-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:45:49Z","timestamp":1777491949000},"page":"2217-2226","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Unsupervised Shortcut Learning Detection and Mitigation in Transformers"],"prefix":"10.1109","author":[{"given":"Lukas","family":"Kuhn","sequence":"first","affiliation":[{"name":"Goethe Universit¨at,Frankfurt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sari","family":"Sadiya","sequence":"additional","affiliation":[{"name":"Goethe Universit¨at,Frankfurt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Schl\u00f6tterer","sequence":"additional","affiliation":[{"name":"Philipps-Universit¨at,Marburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Buettner","sequence":"additional","affiliation":[{"name":"Goethe Universit¨at,Frankfurt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christin","family":"Seifert","sequence":"additional","affiliation":[{"name":"Philipps-Universit¨at,Marburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gemma","family":"Roig","sequence":"additional","affiliation":[{"name":"Goethe Universit¨at,Frankfurt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Post hoc explanations may be ineffective for detecting unknown spurious correlation","volume-title":"International Conference on Learning Representations","author":"Adebayo","year":"2022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1692"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jacr.2023.06.025"},{"key":"ref4","volume-title":"Token merging: Your vit but faster","author":"Bolya","year":"2023"},{"key":"ref5","volume-title":"Vit-reciprocam: Gradient and attention-free visual explanations for vision transformer","author":"Byun","year":"2023"},{"key":"ref6","article-title":"This looks like that: deep learning for interpretable image recognition","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","author":"Chen"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.compmedimag.2019.06.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3546036"},{"key":"ref9","volume-title":"Vicuna: An open-source chatbot impressing gpt-4 with 90%* chatgpt quality","author":"Chiang","year":"2023"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2018.8363547"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-021-00338-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref13","article-title":"An image is worth $16\\times 16$ words: Transformers for image recognition at scale","volume-title":"ICLR","author":"Dosovitskiy","year":"2021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-023-01916-5"},{"key":"ref15","first-page":"336","article-title":"Simple data balancing achieves competitive worst-group-accuracy","volume-title":"Conference on Causal Learning and Reasoning","author":"Idrissi"},{"key":"ref16","article-title":"Last layer re-training is sufficient for robustness to spurious correlations","volume-title":"The Eleventh International Conference on Learning Representations","author":"Kirichenko","year":"2023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-08987-4"},{"key":"ref18","article-title":"Is last layer re-training truly sufficient for robustness to spurious correlations?","volume-title":"Workshop on Explainable Artificial Intelligence","author":"Le","year":"2023"},{"key":"ref19","article-title":"Out of spuriousity: Improving robustness to spurious correlations without group annotations","author":"Le","year":"2025","journal-title":"Transactions on Machine Learning Research"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01922"},{"key":"ref21","first-page":"6781","article-title":"Just train twice: Improving group robustness without training group information","volume-title":"Proceedings of the 38th International Conference on Machine Learning","author":"Liu"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.52202\/075280-1516"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN60899.2024.10650671"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01469"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/diagnostics12010040"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SaTML54575.2023.00039"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-021-00307-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-019-01228-7"},{"key":"ref29","article-title":"No subclass left behind: Fine-grained robustness in coarse-grained classification problems","volume-title":"Proceedings of the 2020 Conference on Neural Information Processing Systems","author":"Sohoni","year":"2020"},{"key":"ref30","article-title":"Overcoming simplicity bias in deep networks using a feature sieve","volume-title":"Proceedings of the 40th International Conference on Machine Learning","author":"Tiwari","year":"2023"},{"key":"ref31","article-title":"Llama: Open and efficient foundation language models","author":"Touvron","year":"2023","journal-title":"arXiv preprint arXiv"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01839"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pmed.1002683"},{"key":"ref34","article-title":"Correct-n-contrast: A contrastive approach for improving robustness to spurious correlations","volume-title":"NeurIPS Workshop on Distribution Shifts: Connecting Methods and Applications","author":"Zhang","year":"2021"}],"event":{"name":"2025 IEEE\/CVF International Conference on Computer Vision (ICCV)","location":"Honolulu, HI, USA","start":{"date-parts":[[2025,10,19]]},"end":{"date-parts":[[2025,10,25]]}},"container-title":["2025 IEEE\/CVF International Conference on Computer Vision (ICCV)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11443115\/11443287\/11445289.pdf?arnumber=11445289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:23:32Z","timestamp":1777613012000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11445289\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/iccv51701.2025.00214","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}