Carpe Diem, Seize the Samples Uncertain "At the Moment" for Adaptive Batch Selection
Hwanjun Song, Minseok Kim, Sundong Kim, Jae-Gil Lee

TL;DR
This paper introduces Recency Bias, an adaptive batch selection method that uses recent uncertain samples to improve training efficiency and accuracy of deep neural networks, outperforming existing methods.
Contribution
The paper presents a novel adaptive batch selection algorithm leveraging recent uncertain samples, enhancing training speed and accuracy over prior approaches.
Findings
Reduced test error by up to 20.97%
Improved training time by up to 59.32%
Demonstrated superiority on multiple tasks
Abstract
The accuracy of deep neural networks is significantly affected by how well mini-batches are constructed during the training step. In this paper, we propose a novel adaptive batch selection algorithm called Recency Bias that exploits the uncertain samples predicted inconsistently in recent iterations. The historical label predictions of each training sample are used to evaluate its predictive uncertainty within a sliding window. Then, the sampling probability for the next mini-batch is assigned to each training sample in proportion to its predictive uncertainty. By taking advantage of this design, Recency Bias not only accelerates the training step but also achieves a more accurate network. We demonstrate the superiority of Recency Bias by extensive evaluation on two independent tasks. Compared with existing batch selection methods, the results showed that Recency Bias reduced the test…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification · Machine Learning and Algorithms · Adversarial Robustness in Machine Learning
MethodsTest
