Zero-Round Active Learning
Not on the map. Why?
Abstract (arXiv)
Active learning (AL) aims at reducing labeling effort by identifying the most valuable unlabeled data points from a large pool. Traditional AL frameworks have two limitations: First, they perform data selection in a multi-round manner, which is time-consuming and impractical. Second, they usually assume that there are a small amount of labeled data points available in the same domain as the data in the unlabeled pool. Recent work proposes a solution for one-round active learning based on data utility learning and optimization, which fixes the first issue but still requires the initially labeled data points in the same domain. In this paper, we propose D2ULO as a solution that solves both issues. Specifically, D2ULO leverages the idea of domain adaptation (DA) to train a data utility model which can effectively predict the utility for any given unlabeled data in the target domain once labeled. The trained data utility model can then be used to select high-utility data and at the same time, provide an estimate for the utility of the selected data. Our algorithm does not rely on any feedback from annotators in the target domain and hence, can be used to perform zero-round active learning or warm-start existing multi-round active learning strategies. Our experiments show that D2ULO outperforms the existing state-of-the-art AL strategies equipped with domain adaptation over various domain shift settings (e.g., real-to-real data and synthetic-to-real data). Particularly, D2ULO is applicable to the scenario where source and target labels have mismatches, which is not supported by the existing works.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 46 references that are in the map. First posted on arXiv 14 Jul 2021.
Builds on
20 of 46 references.
References · 20
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2014Conditional Generative Adversarial Netscited by 2,162
- 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
- 2017Deep Setscited by 1,421
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,329
- 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,082
- 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 683
- 2016Deep Transfer Learning with Joint Adaptation Networkscited by 612
- 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 610
- 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 600
- 2017VisDA: The Visual Domain Adaptation Challengecited by 435
8 more
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2015Simultaneous Deep Transfer Across Domains and Taskscited by 206
- 2019Unsupervised Domain Adaptation through Self-Supervisioncited by 116
- 2014Lazier Than Lazy Greedycited by 99
- 2019Active Adversarial Domain Adaptationcited by 73
- 2021One-Round Active Learningcited by 5
Built on by
Citing papers per year: 2022: 1.
1 paper.