Domain Generalization via Gradient Surgery
Lucas Mansilla, Rodrigo Echeveste, Diego H. Milone, Enzo Ferrante
摘要
In real-life applications, machine learning models often face scenarios where there is a change in data distribution between training and test domains. When the aim is to make predictions on distributions different from those seen at training, we incur in a domain generalization problem. Methods to address this issue learn a model using data from multiple source domains, and then apply this model to the unseen target domain. Our hypothesis is that when training with multiple domains, conflicting gradients within each mini-batch contain information specific to the individual domains which is irrelevant to the others, including the test domain. If left untouched, such disagreement may degrade generalization performance. In this work, we characterize the conflicting gradients emerging in domain shift scenarios and devise novel gradient agreement strategies based on gradient surgery to alleviate their effect. We validate our approach in image classification tasks with three multi-domain datasets, showing the value of the proposed agreement strategy in enhancing the generalization capability of deep learning models in domain shift scenarios. Introduction Deep learning models have shown remarkable results in diverse application areas such as image understanding [13, 29] , speech recognition [10, 19] and natural language processing [25, 27] . Such models are typically trained under the standard supervised learning paradigm, assuming that training and test data come from the same distribution. However, in real life, training and test conditions may differ by several factors, such as a change in data acquisition device or target population. This makes models perform poorly when applied to test data whose distribution differs from the training data and, therefore, limits their implementation in such real scenarios. The goal is then to develop deep learning models that generalize outside the training distribution, under domain shift conditions.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper30
- Fishr: Invariant Gradient Variances for Out-of-Distribution GeneralizationAlexandre Ramé, Corentin Dancette, Matthieu CordICML 2022 · 被引用 262 次
- Domain-General Crowd Counting in Unseen ScenariosZhipeng Du, Jiankang Deng, Miaojing ShiAAAI 2023 · 被引用 63 次
- Towards Open-Set Test-Time Adaptation Utilizing the Wisdom of Crowds in Entropy MinimizationJungsoo Lee, Debasmit Das, Jaegul Choo, Sungha ChoiICCV 2023 · 被引用 48 次
- Generalizable Decision Boundaries: Dualistic Meta-Learning for Open Set Domain GeneralizationXiran Wang, Jian Zhang, Lei Qi, Yinghuan ShiICCV 2023 · 被引用 39 次
- Doodle It Yourself: Class Incremental Learning by Drawing a Few SketchesAyan Kumar Bhunia, Viswanatha Reddy Gajjala, Subhadeep Koley, Rohit Kundu 等CVPR 2022 · 被引用 28 次
它引用的顶会 Paper3
- Gradient Surgery for Multi-Task LearningTianhe Yu, Saurabh Kumar, Abhishek Gupta, Sergey Levine 等NeurIPS 2020 · 被引用 2,261 次
- Gradient Vaccine: Investigating and Improving Multi-task Optimization in Massively Multilingual ModelsZirui Wang, Yulia Tsvetkov, Orhan Firat, Yuan CaoICLR 2021 · 被引用 241 次
- Learning explanations that are hard to varyGiambattista Parascandolo, Alexander Neitz, Antonio Orvieto, Luigi Gresele 等ICLR 2021 · 被引用 221 次
相关 Paper
- Model-Based Domain GeneralizationAlexander Robey, George J. Pappas, Hamed HassaniNeurIPS 2021 · 被引用 167 次
- Federated Unsupervised Domain Generalization Using Global and Local Alignment of GradientsFarhad Pourpanah, Mahdiyar Molahasani, Milad Soltany, Michael A. Greenspan 等AAAI 2025 · 被引用 10 次
- Symmetric Self-Paced Learning for Domain GeneralizationDi Zhao, Yun Sing Koh, Gillian Dobbie, Hongsheng Hu 等AAAI 2024 · 被引用 16 次
- Multi-Source Collaborative Gradient Discrepancy Minimization for Federated Domain GeneralizationYikang Wei, Yahong HanAAAI 2024 · 被引用 20 次
- An Iterative Self-Learning Framework for Medical Domain GeneralizationZhenbang Wu, Huaxiu Yao, David M. Liebovitz, Jimeng SunNeurIPS 2023 · 被引用 12 次
