We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly...
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...