1 / 24

Machine Learning Lecture 5: Theory I – PAC Learning

Machine Learning Lecture 5: Theory I – PAC Learning. Moshe Koppel Slides adapted from Tom Mitchell. To shatter n examples, we need 2 n hypotheses (since there are that many dichotomies. So the number of examples we can shatter with |H| hypotheses < log |H|.

alec-travis
Download Presentation

Machine Learning Lecture 5: Theory I – PAC Learning

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Machine Learning Lecture 5: Theory I – PAC Learning Moshe Koppel Slides adapted from Tom Mitchell

  2. To shatter n examples, we need 2n hypotheses (since there are that many dichotomies. So the number of examples we can shatter with |H| hypotheses < log |H|

More Related