Stopping Criterion for Active Learning Based on Error Stability
Not on the map. Why?
Abstract (arXiv)
Active learning is a framework for supervised learning to improve the predictive performance by adaptively annotating a small number of samples. To realize efficient active learning, both an acquisition function that determines the next datum and a stopping criterion that determines when to stop learning should be considered. In this study, we propose a stopping criterion based on error stability, which guarantees that the change in generalization error upon adding a new sample is bounded by the annotation cost and can be applied to any Bayesian active learning. We demonstrate that the proposed criterion stops active learning at the appropriate timing for various learning models and real datasets.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 12 of its 50 references that are in the map. First posted on arXiv 5 Apr 2021.
Builds on
12 of 50 references.
References · 12
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 428
- 2019A Primer on PAC-Bayesian Learningcited by 130
- 2017Learning Active Learning from Datacited by 100
- 2016PAC-Bayesian Theory Meets Bayesian Inferencecited by 87
- 2016Simpler PAC-Bayesian Bounds for Hostile Datacited by 45
- 2020Active Learning: Problem Settings and Recent Developmentscited by 23
- 2014A Method for Stopping Active Learning Based on Stabilizing Predictions and the Need for User-Adjustable Stoppingcited by 21
- 2020Stopping criterion for active learning based on deterministic generalization boundscited by 20
- 2019MaxiMin Active Learning in Overparameterized Model Classes}cited by 10
- 2019Stopping Active Learning based on Predicted Change of F Measure for Text Classificationcited by 8
- 2015Analysis of Stopping Active Learning based on Stabilizing Predictionscited by 5
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1; 2025: 0; 2026: 2.
6 papers.
- 2021Hitting the Target: Stopping Active Learning at the Cost-Based Optimumcited by 9
- 2022Smooth Sailing: Improving Active Learning for Pre-trained Language Models with Representation Smoothness Analysiscited by 4
- 2026Finding Needles in the Haystack: Transductive Active Labeling in Ecologycited by 3
- 2023Bayesian inference of composition-dependent phase diagramscited by 1
- 2024Reciprocal Learningcited by 0
- 2026Learnable Weighting of Intra-Attribute Distances for Categorical Data Clustering with Nominal and Ordinal Attributescited by 0
- 2026Learnable Weighting of Intra-Attribute Distances for Categorical Data Clustering with Nominal and Ordinal Attributes6 Jul 2026
- 2026Finding Needles in the Haystack: Transductive Active Labeling in Ecology2 Jun 2026
- 2024Reciprocal Learning12 Aug 2024
- 2023Bayesian inference of composition-dependent phase diagrams3 Sep 2023
- 2022Smooth Sailing: Improving Active Learning for Pre-trained Language Models with Representation Smoothness Analysis20 Dec 2022
- 2021Hitting the Target: Stopping Active Learning at the Cost-Based Optimum7 Oct 2021