ASCENT: Active Supervision for Semi-Supervised Learning

• Published in: IEEE transactions on knowledge and data engineering Vol. 32; no. 5; pp. 868 - 882
• Main Authors: Li, Yanchao, Wang, Yongli, Yu, Dong-Jun, Ye, Ning, Hu, Peng, Zhao, Ruxin
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.05.2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Active learning; Algorithms; Artificial neural networks; Ascent; Classification; Clustering; Clustering algorithms; data filtering; Data models; Filtration; iterative learning; Labels; Machine learning; Redundancy; Semi-supervised learning; Semisupervised learning; Task analysis; Teaching methods; Uncertainty
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2019.2897307

Active learning algorithms attempt to overcome the labeling bottleneck by asking queries from large collection of unlabeled examples. Existing batch mode active learning algorithms suffer from three limitations: (1) The methods that are based on similarity function or optimizing certain diversity measurement, in which may lead to suboptimal performance and produce the selected set with redundant examples. (2) The models with assumption on data are hard in finding images that are both informative and representative. (3) The problem of noise labels has been an obstacle for algorithms. In this paper, we propose a novel active learning method that makes embeddings of labeled examples to those of unlabeled ones and back via deep neural networks. The active scheme makes correct association cycles that end up at the same class from that the association was started, which considers both the informativeness and representativeness of examples, as well as being robust to the noise labels. We apply our active learning method to semi-supervised classification and clustering. The submodular function is designed to reduce the redundancy of the selected examples. Specifically, we incorporate our batch mode active scheme into the classification approaches, in which the generalization ability is improved. For semi-supervised clustering, we try to use our active scheme for constraints to make fast convergence and perform better than unsupervised clustering. Finally, we apply our active learning method to data filtering. To validate the effectiveness of the proposed algorithms, extensive experiments are conducted on diversity benchmark datasets for different tasks, i.e., classification, clustering, and data filtering, and the experimental results demonstrate consistent and substantial improvements over the state-of-the-art approaches.