Are Candidate Models Really Needed for Active Learning?
Harshini Mridula Mohan, Maanya Manjunath, Vipul Arya, S.H. Shabbeer Basha, Nitin Cheekatla

TL;DR
This paper explores a simplified active learning approach that eliminates the need for initial candidate models by using randomly initialized CNNs and transformers, achieving comparable results to traditional methods.
Contribution
It demonstrates that confidence-based sampling strategies, especially low confidence, can effectively replace candidate models in active learning, simplifying the process.
Findings
LC strategy often outperforms HC and HCLC in experiments.
The proposed methods are robust across various datasets and domains.
Eliminating candidate models reduces time and resource requirements.
Abstract
Deep learning has profoundly impacted domains such as computer vision and natural language processing by uncovering complex patterns in vast datasets. However, the reliance on extensive labeled data poses significant challenges, including resource constraints and annotation errors, particularly in training Convolutional Neural Networks (CNNs) and transformers due to a larger number of parameters. Active learning offers a promising solution to reduce labeling burdens by strategically selecting the most informative samples for annotation. However, the current active learning frameworks are time-intensive which select the samples iteratively with the help of initial candidate models. This study investigates the feasibility of using CNNs and transformers with randomly initialized weights, eliminating the need for initial candidate models while achieving results comparable to active learning…
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.
