← Back to papers
2011 NIPS NeurIPS 2011

Active Learning with a Drifting Distribution

Abstract

We study the problem of active learning in a stream-based setting, allowing the distribution of the examples to change over time. We prove upper bounds on the number of prediction mistakes and number of label requests for established disagreement-based active learning algorithms, both in the realizable case and under Tsybakov noise. We further prove minimax lower bounds for this problem.

🧭 Keyword Pioneer — distribution drift
🐣 Hot Topic Early Bird — active learning
🐝 Cross-Pollinator — Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio
📈 Trend Setter — Active Learning

Authors

Liu Yang

Topics

Machine Learning > Learning Types > Active Learning Machine Learning > Optimization & Theory > Learning Theory Machine Learning > Optimization & Theory > Statistical Learning Machine Learning > Learning Paradigms > Active Learning Machine Learning > Learning Types > Distribution Shift

Keywords

active learning label complexity distribution shift tsybakov noise distribution drift stream-based learning minimax bounds disagreement-based learning mistake bound minimax lower bound label request
Download PDF

Related papers

Co-Training for Domain Adaptation 2011
The Local Rademacher Complexity of Lp-Norm Multiple Kernel Learning 2011
Learning to Agglomerate Superpixel Hierarchies 2011
A Reinforcement Learning Theory for Homeostatic Regulation 2011
A Global Structural EM Algorithm for a Model of Cancer Progression 2011