mlsanityData to 14 Oct 2026

Collaborative Intelligence Orchestration: Inconsistency-Based Fusion of Semi-Supervised Learning and Active Learning

arXiv 2206.03288 ↗First posted 7 Jun 2022cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

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 label information to unlabeled samples and provides smoothed embeddings for AL, while AL excludes samples with inconsistent predictions and considerable uncertainty for SSL. We estimate unlabeled samples' inconsistency by augmentation strategies of different granularities, including fine-grained continuous perturbation exploration and coarse-grained data transformations. Extensive experiments, in both text and image domains, validate the effectiveness of the proposed algorithm, comparing it against state-of-the-art baselines. Two real-world case studies visualize the practical industrial value of applying and deploying the proposed data sampling algorithm.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 22 of its 39 references that are in the map. First posted on arXiv 7 Jun 2022.

Builds on

22 of 39 references.

References · 22

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
  3. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,391
  4. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  5. 2017Deep Bayesian Active Learning with Image Datacited by 819
  6. 2019Learning Loss for Active Learningcited by 336
  7. 2019Variational Adversarial Active Learningcited by 284
  8. 2020MixText: Linguistically-Informed Interpolation of Hidden Space for Semi-Supervised Text Classificationcited by 187
  9. 2019Consistency-based Semi-supervised Active Learning: Towards Minimizing Labeling Costcited by 114
  10. 2019Uncertainty-guided Continual Learning with Bayesian Neural Networkscited by 102
  11. 2018Deep Bayesian Active Learning for Natural Language Processing: Results of a Large-Scale Empirical Studycited by 90
  12. 2020Task-Aware Variational Adversarial Active Learningcited by 84
10 more
  1. 2020Distinguish Confusing Law Articles for Legal Judgment Predictioncited by 62
  2. 2020State-Relabeling Adversarial Active Learningcited by 60
  3. 2022Compositional Temporal Grounding with Structured Variational Cross-Graph Correspondence Learningcited by 59
  4. 2019Bayesian Generative Active Deep Learningcited by 57
  5. 2018Adversarial Sampling for Active Learningcited by 51
  6. 2021Consensus Graph Representation Learning for Better Grounded Image Captioningcited by 28
  7. 2021MAGIC: Multimodal relAtional Graph adversarIal inferenCe for Diverse and Unpaired Text-based Image Captioningcited by 27
  8. 2022End-to-End Modeling via Information Tree for One-Shot Natural Language Spatial Video Groundingcited by 19
  9. 2021Adaptive Hierarchical Graph Reasoning with Semantic Coherence for Video-and-Language Inferencecited by 18
  10. 2019Combining MixMatch and Active Learning for Better Accuracy with Fewer Labelscited by 17

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1.

2 papers.