Similarity Search for Efficient Active Learning and Search of Rare Concepts
Lists
Only you see this
Abstract
Many active learning and search approaches are intractable for large-scale industrial settings with billions of unlabeled examples. Existing approaches search globally for the optimal examples to label, scaling linearly or even quadratically with the unlabeled data. In this paper, we improve the computational efficiency of active learning and search methods by restricting the candidate pool for labeling to the nearest neighbors of the currently labeled set instead of scanning over all of the unlabeled data. We evaluate several selection strategies in this setting on three large-scale computer vision datasets: ImageNet, OpenImages, and a de-identified and aggregated dataset of 10 billion images provided by a large internet company. Our approach achieved similar mean average precision and recall as the traditional global approach while reducing the computational cost of selection by up to three orders of magnitude, thus enabling web-scale active learning.
BibTeX
@inproceedings{coleman2022similarity,
author = {Cody Coleman and Edward Chou and Julian Katz-Samuels and Sean Culatana and Peter Bailis and Alexander C. Berg and Robert Nowak and Roshan Sumbaly and Matei Zaharia and I. Zeki Yalniz},
title = {{Similarity Search for Efficient Active Learning and Search of Rare Concepts}},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2022},
doi = {10.1609/aaai.v36i6.20591},
}| Scaling Active Search using Linear Similarity Functions | arXiv · 2017 |
| Active Learning from the Web | arXiv · 2022 |
| Search Improves Label for Active Learning | arXiv · 2016 |
| Nearest-Neighbor-Based Active Learning for Rare Category Detection | NeurIPS · 2007 |
| A Scalable Algorithm for Active Learning | arXiv · 2024 |
| Amortized nonmyopic active search via deep imitation learning | arXiv · 2024 |