Collaborative Intelligence Orchestration: Inconsistency-Based Fusion of Semi-Supervised Learning and Active Learning
Jiannan Guo, Yangyang Kang, Yu Duan, Xiaozhong Liu, Siliang Tang,, Wenqiao Zhang, Kun Kuang, Changlong Sun, Fei Wu

TL;DR
This paper introduces IDEAL, an innovative inconsistency-based fusion method for semi-supervised and active learning that enhances data labeling efficiency and reduces computational costs, validated through extensive experiments.
Contribution
The paper proposes a novel inconsistency-based fusion algorithm, IDEAL, that jointly optimizes semi-supervised and active learning by leveraging inconsistency estimation and augmentation strategies.
Findings
IDEAL outperforms state-of-the-art baselines in text and image tasks.
The method effectively reduces labeling costs and improves model performance.
Industrial case studies demonstrate practical deployment benefits.
Abstract
While annotating decent amounts of data to satisfy sophisticated learning models can be cost-prohibitive for many real-world applications. Active learning (AL) and semi-supervised learning (SSL) are two effective, but often isolated, means to alleviate the data-hungry problem. Some recent studies explored the potential of combining AL and SSL to better probe the unlabeled data. However, almost all these contemporary SSL-AL works use a simple combination strategy, ignoring SSL and AL's inherent relation. Further, other methods suffer from high computational costs when dealing with large-scale, high-dimensional datasets. Motivated by the industry practice of labeling data, we propose an innovative Inconsistency-based virtual aDvErsarial Active Learning (IDEAL) algorithm to further investigate SSL-AL's potential superiority and achieve mutual enhancement of AL and SSL, i.e., SSL propagates…
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.
