On Learnability, Complexity and Stability

03/24/2013

∙

by   Silvia Villa, et al.

∙

MIT

∙

Istituto Italiano di Tecnologia

∙

0

∙

share

We consider the fundamental question of learnability of a hypotheses class in the supervised learning setting and in the general learning setting introduced by Vladimir Vapnik. We survey classic results characterizing learnability in term of suitable notions of complexity, as well as more recent results that establish the connection between learnability and stability of a learning algorithm.