7 citations · 9 across the 3 of their papers we have counts for
4 papers
A Theory of PAC Learnability of Partial Concept Classes
Noga Alon, Steve Hanneke, Ron Holzman +1
We extend the theory of PAC learning in a way which allows to model a rich variety of learning tasks where the data satisfy special properties that ease the learning process. For e…
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games
Steve Hanneke, Roi Livni, Shay Moran
Which classes can be learned properly in the online model? -- that is, by an algorithm that at each round uses a predictor from the concept class. While there are simple and natura…
A Theory of Universal Learning
Olivier Bousquet, Steve Hanneke, Shay Moran +2
How quickly can a given class of concepts be learned from examples? It is common to measure the performance of a supervised machine learning algorithm by plotting its "learning cur…
Proper Learning, Helly Number, and an Optimal SVM Bound
Olivier Bousquet, Steve Hanneke, Shay Moran +1
The classical PAC sample complexity bounds are stated for any Empirical Risk Minimizer (ERM) and contain an extra logarithmic factor which is known to be necessary for…