Pith. sign in

REVIEW 2 cited by

Towards General and Efficient 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 2112.07963 v2 pith:33QGFCYV submitted 2021-12-15 cs.CV cs.LG

classification cs.CVcs.LG
keywords activelearningdatamethodmodelavailablebatchefficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Active learning selects the most informative samples to exploit limited annotation budgets. Existing work follows a cumbersome pipeline that repeats the time-consuming model training and batch data selection multiple times. In this paper, we challenge this status quo by proposing a novel general and efficient active learning (GEAL) method following our designed new pipeline. Utilizing a publicly available pretrained model, our method selects data from different datasets with a single-pass inference of the same model without extra training or supervision. To capture subtle local information, we propose knowledge clusters extracted from intermediate features. Free from the troublesome batch selection strategy, all data samples are selected in one-shot through a distance-based sampling in the fine-grained knowledge cluster level. This whole process is faster than prior arts by hundreds of times. Extensive experiments verify the effectiveness of our method on object detection, image classification, and semantic segmentation. Our code is publicly available in https://github.com/yichen928/GEAL_active_learning.

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. Active Learning via Classifier Impact and Greedy Selection for Interactive Image Retrieval

    cs.CV 2024-12 conditional novelty 6.0 of 10

    GAL selects images for user labeling by the estimated impact of each candidate on the retrieval classifier, using a greedy batch scheme, and reports improved retrieval accuracy over prior active learning methods on fo...

  2. Image Classification with Deep Reinforcement Active Learning

    cs.CV 2024-12 conditional novelty 4.0 of 10

    An active learning method that uses deep reinforcement learning (DDPG) to decide which unlabeled images to query, after pre-ranking images by margin uncertainty, reports modest accuracy improvements on CIFAR-10, SVHN,...

Pith tools