发帖
雷达卡
Shai Shalev-Shwartz and Shai Ben-David
This coursebook is divided into four parts. The first part aims at giving an initial rigorous answer to the fundamental questions of learning. We describe a generalization of Valiant’s Probably Approximately Correct (PAC) learning model, which is a first solid answer to the question “what is learning?”. We describe the Empirical Risk Minimization (ERM), Structural Risk Minimization (SRM), and Minimum Description Length (MDL) learning rules, which shows “how can a machine learn”. We quantify the amount of data needed for learning using the ERM, SRM, and MDL rules and show how learning might fail by derivinga “no-free-lunch” theorem. We also discuss how much computation time is required for learning. In the second part of the coursebook we describe various learning algorithms. For some of the algorithms, we first present a more general learning principle, and then show how the algorithm follows the principle. While the first two parts of the book focus on the PAC model, the third part extends the scope by presenting a wider variety of learning models. Finally, the last part of the book is devoted to advanced theory.
understanding-machine-learning-theory-algorithms.pdf
(2.37 MB, 需要: RMB 19 元)
京公网安备 11010802022788号
