Record
- Authors
- Shalev-Shwartz, S.; Ben-David, S.
- Year
- 2014
- Title
- Understanding Machine Learning: From Theory to Algorithms
- Type
- Book
- Our note
- none yet
- Verification
- unverified: not yet checked against the source
- Id
shalev-shwartz-2014-understanding-machine-learning-from-theory-algorithms
Cited on
- Concentration Inequalities: Hoeffding and Bernstein for Appendix B read status: not stated
- Empirical Risk Minimization for §2.2; §2.2.1; §3.2.1; §5.2; §12.3 read status: not stated
- PAC Learning and Finite Hypothesis Classes read status: not stated
- Rademacher Complexity for §26.5; §28.1 and 28.2 read status: not stated
- Statistical Learning Theory read status: not stated
- The VC Dimension read status: not stated
As cited
The pages cite this work in 4 forms.
-
Shalev-Shwartz, S., and Ben-David, S. (2014). Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press.
-
Shalev-Shwartz, S., and Ben-David, S. (2014). Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press. Appendix B: Lemmas B.7 (Hoeffding's lemma) and B.9 (Bernstein's inequality).
-
Shalev-Shwartz, S., and Ben-David, S. (2014). Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press. Eqs. 26.4 and 26.5; Theorem 6.8; §26.5; Lemmas 26.2, 26.8, 26.9 and 26.10; Theorems 26.5, 26.12 and 26.14; §§28.1 and 28.2.
-
Shalev-Shwartz, S., and Ben-David, S. (2014). Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press. §2.2 (empirical risk minimization and the memorizer, §2.2.1), §3.2.1 (the Bayes optimal predictor), Lemma 4.2, Theorem 5.1 (no free lunch), §5.2 (error decomposition) and §12.3 (surrogate loss functions); section numbers from the authors' online copy.
BibLaTeX
@book{shalev-shwartz-2014-understanding-machine-learning-from-theory-algorithms,
author = {Shalev-Shwartz, S. and Ben-David, S.},
title = {{Understanding Machine Learning: From Theory to Algorithms}},
date = {2014}
}