Symmetric Self-Paced Learning for Domain Generalization

Authors

  • Di Zhao School of Computer Science, University of Auckland
  • Yun Sing Koh School of Computer Science, University of Auckland
  • Gillian Dobbie School of Computer Science, University of Auckland
  • Hongsheng Hu CSIRO‘s Data61
  • Philippe Fournier-Viger College of Computer Science and Software Engineering Shenzhen University

DOI:

https://doi.org/10.1609/aaai.v38i15.29639

Keywords:

ML: Transfer, Domain Adaptation, Multi-Task Learning, ML: Deep Learning Algorithms

Abstract

Deep learning methods often suffer performance degradation due to domain shift, where discrepancies exist between training and testing data distributions. Domain generalization mitigates this problem by leveraging information from multiple source domains to enhance model generalization capabilities for unseen domains. However, existing domain generalization methods typically present examples to the model in a random manner, overlooking the potential benefits of structured data presentation. To bridge this gap, we propose a novel learning strategy, Symmetric Self-Paced Learning (SSPL), for domain generalization. SSPL consists of a Symmetric Self-Paced training scheduler and a Gradient-based Difficulty Measure (GDM). Specifically, the proposed training scheduler initially focuses on easy examples, gradually shifting emphasis to harder examples as training progresses. GDM dynamically evaluates example difficulty through the gradient magnitude with respect to the example itself. Experiments across five popular benchmark datasets demonstrate the effectiveness of the proposed learning strategy.

Published

2024-03-24

How to Cite

Zhao, D., Koh, Y. S., Dobbie, G., Hu, H., & Fournier-Viger, P. (2024). Symmetric Self-Paced Learning for Domain Generalization. Proceedings of the AAAI Conference on Artificial Intelligence, 38(15), 16961–16969. https://doi.org/10.1609/aaai.v38i15.29639

Issue

Section

AAAI Technical Track on Machine Learning VI