On Learnability, Complexity and Stability

DOI10.1007/978-3-642-41136-6_7zbMATH Open1330.68259arXiv1303.5976OpenAlexW2124927118MaRDI QIDQ5264089FDOQ5264089

Silvia Villa, T. Poggio, Lorenzo Rosasco

Publication date: 20 July 2015

Published in: Empirical Inference (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1303.5976

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Cited In (5)

• Fluctuations, effective learnability and metastability in analysis
• Control structures in hypothesis spaces: The influence on learning
• Title not available (Why is that?)
• On the intrinsic complexity of learning
• On a general structure for adaptation/learning algorithms. -- Stability and performance issues

This page was built for publication: On Learnability, Complexity and Stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264089)