Stochastic Batch Acquisition: A Simple Baseline for Deep Active Learning
read the original abstract
We examine a simple stochastic strategy for adapting well-known single-point acquisition functions to allow batch active learning. Unlike acquiring the top-K points from the pool set, score- or rank-based sampling takes into account that acquisition scores change as new data are acquired. This simple strategy for adapting standard single-sample acquisition strategies can even perform just as well as compute-intensive state-of-the-art batch acquisition functions, like BatchBALD or BADGE, while using orders of magnitude less compute. In addition to providing a practical option for machine learning practitioners, the surprising success of the proposed method in a wide range of experimental settings raises a difficult question for the field: when are these expensive batch acquisition methods pulling their weight?
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
A Mutual Information Lower Bound for Multimodal Regression Active Learning
Derives MI-LB acquisition function from mutual information in a two-index epistemic-aleatoric framework and shows it outperforms baselines on multimodal regression benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.