3 citations · 5 across the 3 of their papers we have counts for
4 papers
Universally Consistent Online Learning with Arbitrarily Dependent Responses
Steve Hanneke
This work provides an online learning rule that is universally consistent under processes on (X,Y) pairs, under conditions only on the X process. As a special case, the conditions…
Robustly-reliable learners under poisoning attacks
Maria-Florina Balcan, Avrim Blum, Steve Hanneke +1
Data poisoning attacks, in which an adversary corrupts a training set with the goal of inducing specific desired mistakes, have raised substantial concern: even just the possibilit…
Minimax Analysis of Active Learning
Steve Hanneke, Liu Yang
This work establishes distribution-free upper and lower bounds on the minimax label complexity of active learning with general hypothesis classes, under various noise models. The r…
A Compression Technique for Analyzing Disagreement-Based Active Learning
Yair Wiener, Steve Hanneke, Ran El-Yaniv
We introduce a new and improved characterization of the label complexity of disagreement-based active learning, in which the leading quantity is the version space compression set s…