Summary: Learnability and Automatizability
Misha Alekhnovich 
IAS, Princeton
misha@math.ias.edu
Mark Braverman y
U. Toronto
mbraverm@cs.toronto.edu
Vitaly Feldman z
Harvard University
vitaly@eecs.harvard.edu
Adam R. Klivans x
Toyota Technological Institute
klivans@tti­c.org
Toniann Pitassi {
IAS, Princeton and U. Toronto
toni@cs.toronto.edu
Abstract
We consider the complexity of properly learning concept
classes, i.e. when the learner must output a hypothesis of
the same form as the unknown concept. We present the fol­

Source: Alekhnovich, Michael - Institute for Advanced Study, Princeton University
Pitassi, Toniann - Department of Computer Science, University of Toronto

Collections: Computer Technologies and Information Sciences; Mathematics