Efficient and Parsimonious Agnostic Active Learning

by   Tzu-Kuo Huang, et al.
Columbia University

We develop a new active learning algorithm for the streaming setting satisfying three important properties: 1) It provably works for any classifier representation and classification problem including those with severe noise. 2) It is efficiently implementable with an ERM oracle. 3) It is more aggressive than all previous approaches satisfying 1 and 2. To do this we create an algorithm based on a newly defined optimization problem and analyze it. We also conduct the first experimental analysis of all efficient agnostic active learning algorithms, evaluating their strengths and weaknesses in different settings.


page 1

page 2

page 3

page 4


Beyond Disagreement-based Agnostic Active Learning

We study agnostic active learning, where the goal is to learn a classifi...

Online Active Learning of Reject Option Classifiers

Active learning is an important technique to reduce the number of labele...

The Label Complexity of Active Learning from Observational Data

Counterfactual learning from observational data involves learning a clas...

Improved Algorithms for Agnostic Pool-based Active Classification

We consider active learning for binary classification in the agnostic po...

A quantum active learning algorithm for sampling against adversarial attacks

Adversarial attacks represent a serious menace for learning algorithms a...

A Benchmark for Active Learning of Variability-Intensive Systems

Behavioral models are the key enablers for behavioral analysis of Softwa...

Improved Algorithms for Neural Active Learning

We improve the theoretical and empirical performance of neural-network(N...

Please sign up or login with your details

Forgot password? Click here to reset