Pith. sign in

REVIEW 2 cited by

Stochastic Batch Acquisition: A Simple Baseline for Deep Active Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.12059 v3 pith:COYX65WP submitted 2021-06-22 cs.LG stat.ML

classification cs.LGstat.ML
keywords acquisitionbatchlearningsimpleactiveadaptingfunctionsstochastic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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?

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. X-Factor: Quality Is a Dataset-Intrinsic Property

    cs.LG 2025-05 conditional novelty 5.0 of 10

    Across 2,500 class-balanced MNIST subsets and 10 model architectures, test-error Z-scores correlate strongly across models (mean R2=0.82 excluding GNB), supporting dataset quality as an intrinsic property.

  2. ConBatch-BAL: Batch Bayesian Active Learning under Budget Constraints

    cs.LG 2025-07 conditional novelty 4.0 of 10

    Two budget-aware batch active learning heuristics, greedy and dynamic thresholding, reduce the number of labeling rounds needed to reach target accuracy on new building image datasets compared with random selection.

Pith tools