LGMLFeb 16, 2020

Learning Adaptive Loss for Robust Learning with Noisy Labels

arXiv:2002.06482v123 citations
Originality Incremental advance
AI Analysis

This work addresses a practical bottleneck in robust learning for noisy label scenarios, offering an incremental improvement over existing methods.

The paper tackles the problem of hyperparameter tuning in robust loss functions for learning with noisy labels by proposing a meta-learning method that adaptively learns these hyperparameters, achieving improved accuracy and generalization compared to conventional tuning strategies.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes