Meta-Learning Mini-Batch Risk Functionals
Not on the map. Why?
Abstract (arXiv)
Supervised learning typically optimizes the expected value risk functional of the loss, but in many cases, we want to optimize for other risk functionals. In full-batch gradient descent, this is done by taking gradients of a risk functional of interest, such as the Conditional Value at Risk (CVaR) which ignores some quantile of extreme losses. However, deep learning must almost always use mini-batch gradient descent, and lack of unbiased estimators of various risk functionals make the right optimization procedure unclear. In this work, we introduce a meta-learning-based method of learning an interpretable mini-batch risk functional during model training, in a single shot. When optimizing for various risk functionals, the learned mini-batch risk functions lead to risk reduction of up to 10% over hand-engineered mini-batch risk functionals. Then in a setting where the right risk functional is unknown a priori, our method improves over baseline by 14% relative (~9% absolute). We analyze the learned mini-batch risk functionals at different points through training, and find that they learn a curriculum (including warm-up periods), and that their final form can be surprisingly different from the underlying risk functional that they optimize for.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 27 Jan 2023.
Builds on
19 of 35 references.
References · 19
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
- 2017Robust Loss Functions under Label Noise for Deep Neural Networkscited by 441
- 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
- 2018Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe Noisecited by 216
- 2017Super-Convergence: Very Fast Training of Neural Networks Using Large Learning Ratescited by 196
- 2019Mitigating Bias in Algorithmic Hiring: Evaluating Claims and Practicescited by 170
- 2017Active Bias: Training More Accurate Neural Networks by Emphasizing High Variance Samplescited by 147
- 2020Dual T: Reducing Estimation Error for Transition Matrix in Label-noise Learningcited by 142
7 more
- 2020Tilted Empirical Risk Minimizationcited by 103
- 2018Masking: A New Perspective of Noisy Supervisioncited by 93
- 2019Curriculum Loss: Robust Learning and Generalization against Label Corruptioncited by 87
- 2019Robust Bi-Tempered Logistic Loss Based on Bregman Divergencescited by 61
- 2020Distributionally Robust Losses for Latent Covariate Mixturescited by 57
- 2018Deep Bilevel Learningcited by 48
- 2017Deep Learning from Noisy Image Labels with Quality Embeddingcited by 46
Built on by
Not cited yet.