Although neural networks are conventionally optimized towards zero training loss, it has been recently learned that targeting a non-zero training loss threshold, referred to as a flood level, often enables better test time generalization. Current approaches, however, apply the same constant flood level to all training samples, which inherently assumes all the samples have the same difficulty. We present AdaFlood, a novel flood regularization method that adapts the flood level of each training sample according to the difficulty of the sample. Intuitively, since training samples are not equal in difficulty, the target training loss should be conditioned on the instance. Experiments on datasets covering four diverse input modalities – text, images, asynchronous event sequences, and tabular – demonstrate the versatility of AdaFlood across data domains and noise levels.
Bibtex
@article{bae2024adaflood,
title={AdaFlood: Adaptive Flood Regularization},
author={Bae, Wonho and Ren, Yi and Ahmed, Mohamad Osama and Tung, Frederick and Sutherland, Danica J and Oliveira, Gabriel L},
journal={Transactions on Machine Learning Research (TMLR)},
year={2024}
}
Related Research
-
Exploring Model Invariance with Discrete Search for Ultra-Low-Bit Quantization
Exploring Model Invariance with Discrete Search for Ultra-Low-Bit Quantization
Y. Wen, Y. Cao, and L. Mou. CIKM
Publications
-
Score-based Outlier Generation via Controlling the Radon-Nikodym Derivative
Score-based Outlier Generation via Controlling the Radon-Nikodym Derivative
A. Mukherjee, T. Milne, K. Y. C. Lui, S. Hazlewood, and J. Liu. IEEE Conference on Decision and Control
Publications
-
Investigating Action Embeddings for More Efficient Off-Policy Evaluation
Investigating Action Embeddings for More Efficient Off-Policy Evaluation
M. Wabartha, K. Wilson, R. David Evans, H. Sharifi, and T. Sylvain. RecSys CONSEQUENCES Workshop
Publications