2021 IEEE/CVF International Conference on Computer Vision (ICCV) · 2021 · 27 citations · 27 references
ComputingComputer ScienceData MiningFeature EngineeringMachine LearningActive LearningDomain AnalysisOptimization For Machine LearningRepresentation LearningUnsupervised LearningAdversarial Domain AdaptationDomain AdaptationDomain GeneralizationFeature Subset SelectionSubmodular MaximizationSubmodular OptimizationSubset Selection
Unsupervised domain adaptation (DA) methods have focused on achieving maximal performance through aligning features from source and target domains without using labeled data in the target domain. Whereas, in the real-world scenario’s it might be feasible to get labels for a small proportion of target data. In these scenarios, it is important to select maximally-informative samples to label and find an effective way to combine them with the existing knowledge from source data. Towards achieving this, we propose S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> VAADA which i) introduces a novel submodular criterion to select a maximally informative subset to label and ii) enhances a cluster-based DA procedure through novel improvements to effectively utilize all the available data for improving generalization on target. Our approach consistently outperforms the competing state-of-the-art approaches on datasets with varying degrees of domain shifts. The project page with additional details is available here: https://sites.google.com/iisc.ac.in/s3vaada-iccv2021/.
27
Deep Residual Learning for Image Recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren et al. · 2016 · 222.1K citations · Full text
k-means++: the advantages of careful seeding
David Arthur, Sergei Vassilvitskii · 2007 · 6.3K citations
Active Learning Literature Survey
Burr Settles · Minds at UW (University of Wisconsin) · 2009 · 4.8K citations · Full text