10-601B Generalization and Overfitting: Sample Complexity Results for Supervised Classification 2

From Cohen Courses
Revision as of 10:53, 23 February 2016 by Tdick (talk | contribs) (Created page with "This a lecture used in the Syllabus for Machine Learning 10-601B in Spring 2016 === Slides === * [http://curtis.ml.cmu.edu/w/courses/images/0/06/Sample-complexity2-2016....")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

This a lecture used in the Syllabus for Machine Learning 10-601B in Spring 2016

Slides

Readings

  • Mitchell Chapter 7

What you should remember

  • The notion of sample complexity.
  • Shattering.
  • VC dimension as measure of complexity.
  • Sauer’s lemma.
  • Form of the VC bounds.