Online Choice of Active Learning Algorithms

Abstract

This paper is concerned with the question of how to online combine an ensemble of active learners so as to expedite the learning progress during a pool-based active learning session. We develop a powerful active learning master algorithm, based a known competitive algorithm for the multi-armed bandit problem and a novel semi-supervised performance evaluation statistic. Taking an ensemble containing two of the best known active learning algorithms and a new algorithm, the resulting new active learning master algorithm is empirically shown to consistently perform almost as well as and sometimes outperform the best algorithm in the ensemble on a range of classification problems.

Extracted Key Phrases

7 Figures and Tables

02040'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

292 Citations

Semantic Scholar estimates that this publication has 292 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Baram2003OnlineCO, title={Online Choice of Active Learning Algorithms}, author={Yoram Baram and Ran El-Yaniv and Kobi Luz}, journal={Journal of Machine Learning Research}, year={2003}, volume={5}, pages={255-291} }