arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.5976stat.MLcs.LG
收藏

论可学性、复杂性与稳定性

On Learnability, Complexity and Stability

Massachusetts Institute of Technology(麻省理工学院);Istituto Italiano di Tecnologia(意大利理工学院);Universita’ degli Studi di Genova(热那亚大学)

Silvia Villa, Lorenzo Rosasco, Tomaso Poggio

摘要:

我们认为,在监督学习设置和弗拉基米尔Vapnik介绍的一般学习设置的假设类的可学习性的基本问题。我们调查经典的结果,表征可学习性的复杂性的合适的概念,以及最近的结果,建立学习算法的可学习性和稳定性之间的联系。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑