arXiv Analytics

Sign in

arXiv:2002.06482 [cs.LG]AbstractReferencesReviewsResources

Learning Adaptive Loss for Robust Learning with Noisy Labels

Jun Shu, Qian Zhao, Keyu Chen, Zongben Xu, Deyu Meng

Published 2020-02-16Version 1

Robust loss minimization is an important strategy for handling robust learning issue on noisy labels. Current robust loss functions, however, inevitably involve hyperparameter(s) to be tuned, manually or heuristically through cross validation, which makes them fairly hard to be generally applied in practice. Besides, the non-convexity brought by the loss as well as the complicated network architecture makes it easily trapped into an unexpected solution with poor generalization capability. To address above issues, we propose a meta-learning method capable of adaptively learning hyperparameter in robust loss functions. Specifically, through mutual amelioration between robust loss hyperparameter and network parameters in our method, both of them can be simultaneously finely learned and coordinated to attain solutions with good generalization capability. Four kinds of SOTA robust loss functions are attempted to be integrated into our algorithm, and comprehensive experiments substantiate the general availability and effectiveness of the proposed method in both its accuracy and generalization performance, as compared with conventional hyperparameter tuning strategy, even with carefully tuned hyperparameters.

Related articles: Most relevant | Search more
arXiv:1910.03231 [cs.LG] (Published 2019-10-08)
Peer Loss Functions: Learning from Noisy Labels without Knowing Noise Rates
arXiv:2104.06574 [cs.LG] (Published 2021-04-14)
Joint Negative and Positive Learning for Noisy Labels
arXiv:2206.13140 [cs.LG] (Published 2022-06-27)
Compressing Features for Learning with Noisy Labels