mlsanityData to 7 Oct 2026

Mitigating Label Noise using Prompt-Based Hyperbolic Meta-Learning in Open-Set Domain Generalization

arXiv 2412.18342 ↗First posted 24 Dec 2024cs.CV cs.LG eess.IVcited by 6

Not on the map. Why?

Abstract (arXiv)

Open-Set Domain Generalization (OSDG) is a challenging task requiring models to accurately predict familiar categories while minimizing confidence for unknown categories to effectively reject them in unseen domains. While the OSDG field has seen considerable advancements, the impact of label noise--a common issue in real-world datasets--has been largely overlooked. Label noise can mislead model optimization, thereby exacerbating the challenges of open-set recognition in novel domains. In this study, we take the first step towards addressing Open-Set Domain Generalization under Noisy Labels (OSDG-NL) by constructing dedicated benchmarks derived from widely used OSDG datasets, including PACS and DigitsDG. We evaluate baseline approaches by integrating techniques from both label denoising and OSDG methodologies, highlighting the limitations of existing strategies in handling label noise effectively. To address these limitations, we propose HyProMeta, a novel framework that integrates hyperbolic category prototypes for label noise-aware meta-learning alongside a learnable new-category agnostic prompt designed to enhance generalization to unseen classes. Our extensive experiments demonstrate the superior performance of HyProMeta compared to state-of-the-art methods across the newly established benchmarks. The source code of this work is released at https://github.com/KPeng9510/HyProMeta.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 69 of its 100 references that are in the map. First posted on arXiv 24 Dec 2024.

Builds on

69 of 100 references.

References · 69

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  5. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  6. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
  7. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
  8. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  9. 2017Deeper, Broader and Artier Domain Generalizationcited by 983
  10. 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
  11. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 762
  12. 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 691
38 more
  1. 2021Domain Generalization with MixStylecited by 563
  2. 2015Towards Open Set Deep Networkscited by 533
  3. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
  4. 2018Recent Advances in Open Set Recognition: A Surveycited by 309
  5. 2020Learning to Generate Novel Domains for Domain Generalizationcited by 296
  6. 2020Normalized Loss Functions for Deep Learning with Noisy Labelscited by 257
  7. 2020Deep Domain-Adversarial Image Generation for Domain Generalisationcited by 231
  8. 2019Understanding and Utilizing Deep Neural Networks Trained with Noisy Labelscited by 209
  9. 2019Are Anchor Points Really Indispensable in Label-Noise Learning?cited by 208
  10. 2020Does label smoothing mitigate label noise?cited by 204
  11. 2019Learning to Optimize Domain Specific Normalization for Domain Generalizationcited by 160
  12. 2020Domain Adaptive Ensemble Learningcited by 156
  13. 2021Adversarial Reciprocal Points Learning for Open Set Recognitioncited by 153
  14. 2018Classification-Reconstruction Learning for Open-Set Recognitioncited by 146
  15. 2019Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Ratescited by 142
  16. 2021OpenGAN: Open-Set Recognition via Open Data Generationcited by 135
  17. 2019Learning From Noisy Labels By Regularized Estimation Of Annotator Confusioncited by 126
  18. 2020Domain Generalization for Medical Imaging Classification with Linear-Dependency Regularizationcited by 122
  19. 2020Learning Open Set Network with Discriminative Reciprocal Pointscited by 115
  20. 2021Open Domain Generalization with Domain-Augmented Meta-Learningcited by 115
  21. 2022Selective-Supervised Contrastive Learning with Noisy Labelscited by 112
  22. 2019Meta Label Correction for Noisy Label Learningcited by 108
  23. 2017Deep Metric Learning with Angular Losscited by 107
  24. 2020Heterogeneous Domain Generalization via Domain Mixupcited by 103
  25. 2021Progressive Domain Expansion Network for Single Domain Generalizationcited by 96
  26. 2021Evidential Deep Learning for Open Set Action Recognitioncited by 96
  27. 2022Robust Training under Label Noise by Over-parameterizationcited by 93
  28. 2020A Second-Order Approach to Learning with Instance-Dependent Label Noisecited by 90
  29. 2020Beyond Class-Conditional Assumption: A Primary Attempt to Combat Instance-Dependent Label Noisecited by 82
  30. 2021FINE Samples for Learning with Noisy Labelscited by 82
  31. 2022UNICON: Combating Label Noise Through Uniform Selection and Contrastive Learningcited by 77
  32. 2020Error-Bounded Correction of Noisy Labelscited by 74
  33. 2021To Smooth or Not? When Label Smoothing Meets Noisy Labelscited by 70
  34. 2021Clusterability as an Alternative to Anchor Points When Learning with Noisy Labelscited by 65
  35. 2021Open-set Label Noise Can Improve Robustness Against Inherent Label Noisecited by 58
  36. 2022The Numerical Stability of Hyperbolic Representation Learningcited by 46
  37. 2019Open Set Domain Adaptation for Image and Action Recognitioncited by 30
  38. 2020Weakly Supervised Learning with Side Information for Noisy Labeled Imagescited by 30

50 most cited of 69 All 69 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 3.

6 papers.