1 March 2019 in Pattern Recognition Letters
28 November 2017 in IEEE Transactions on Knowledge and Data Engineering
The goal of online active learning is to learn predictive models from a sequence of unlabeled data given limited label query budget. Unlike conventional online learning tasks, online active learning is considerably more challenging since the online learner not only needs to decide how to update the predictive models effectively whenever a labeled training sample is available, but also needs to determine when is appropriate to query the label of an incoming unlabeled instance given limited label query budget. Most existing approaches for online active learning are often based on the family of first-order online learning algorithms, which are simple and efficient but falls short in slow convergence and sub-optimal solution in exploiting the labeled training data. To conquer these limitations, this paper presents a novel framework of Second-order Online Active Learning (SOAL). To further make SOAL practical for real-world applications, especially for class-imbalanced online classification tasks (e.g., malicious web detection), we extend the SOAL framework by proposing the Cost-sensitive Second-order Online Active Learning algorithm named “SOAL$_{CS}$”. We conducted both theoretical analysis and empirical studies, in which the promising empirical results validate the efficacy and scalability of the proposed online active learning algorithms towards large-scale online learning tasks.
2 November 2017 in Machine Learning
27 June 2018 in ACM Transactions on Knowledge Discovery From Data
In literature, learning with expert advice methods usually assume that a learner always obtain the true label of every incoming training instance at the end of each trial. However, in many real-world applications, acquiring the true labels of all instances can be both costly and time consuming, especially for large-scale problems. For example, in the social media, data stream usually comes in a high speed and volume, and it is nearly impossible and highly costly to label all of the instances. In this article, we address this problem with active learning with expert advice, where the ground truth of an instance is disclosed only when it is requested by the proposed active query strategies. Our goal is to minimize the number of requests while training an online learning model without sacrificing the performance. To address this challenge, we propose a framework of active forecasters, which attempts to extend two fully supervised forecasters, Exponentially Weighted Average Forecaster and Greedy Forecaster, to tackle the task of online active learning (OAL) with expert advice. Specifically, we proposed two OAL with expert advice algorithms, named Active Exponentially Weighted Average Forecaster (AEWAF) and active greedy forecaster (AGF), by considering the difference of expert advices. To further improve the robustness of the proposed AEWAF and AGF algorithms in the noisy scenarios (where noisy experts exist), we also proposed two robust active learning with expert advice algorithms, named Robust Active Exponentially Weighted Average Forecaster and Robust Active Greedy Forecaster. We validate the efficacy of the proposed algorithms by an extensive set of experiments in both normal scenarios (where all of experts are comparably reliable) and noisy scenarios.