DOC PREVIEW
CMU CS 10701 - Computational Learning Theory

This preview shows page 1-2-3 out of 10 pages.

Save
View full document
Premium Document
Do you want full access? Go Premium and unlock all 10 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Computational Learning Theory 10 701 15 781 Recitation March 25 2010 Ni Lao What s Computational Learning Theory Laws about whether we can perform learning successfully or not Instead of relying purely on empirical knowledge our skills in probability can help Often in the form of the following question With a family of models H of certain complexity how many training samples R is needed in order to learn a model h with reasonable training time and sufficient accuracy on future data Major components Model complexity Num of parameters Size of hypothesis space VC dimension Sample complexity Error rate Time complexity What We Have Learnt in Class For categorical inputs PAC Learning Probably Approximately Correct Learning All inputs and outputs are binary easy to measure H Data is noiseless easy to analyze For continuous inputs VC dimension a hypothesis family H can shatter a set of points x1 x2 xr iff for every possible label y1 y2 yr 2r of them there exists some hypothesis h in H that can gets zero training error VC H is the maximum number of points that can be shattered by H Example PAC Learning of Boolean Functions Chose number of samples R such that with probability less than we ll select a bad hypothesis which makes mistakes more than fraction of the time l rma o N ctive n u j Dis DNF Form R b H g 2 o l a 2001 Andrew W Moore Example VCd of Circle Hypothesis H f x b sign x x b VC H N 1 N 2 2001 Andrew W Moore Example VCd of Circle Hypothesis H f x a b sign ax x b VC H N 2 N 3 n Ofte No VC H er t e m a Par 2001 Andrew W Moore Homework 4 VCd of Gaussian Bayes Models Practice your VCd finding skills in two class classification problems Homework 4 Linear Regression Model express the average risk R n for linear regression 0 as a function of features p and samples n Result from hw3 slightly revised Summary of Model Selection Methods VC dimension Structural Risk Minimization Very conservative AIC Akaike Information Criterion Asymptotically the same as Leave one out CV BIC Bayesian Information Criterion Asymptotically the same as a carefully chosen k fold CV CV Cross validation The ultimate weapon used by most people who apply ML techniques The End Thanks


View Full Document

CMU CS 10701 - Computational Learning Theory

Documents in this Course
lecture

lecture

12 pages

lecture

lecture

17 pages

HMMs

HMMs

40 pages

lecture

lecture

15 pages

lecture

lecture

20 pages

Notes

Notes

10 pages

Notes

Notes

15 pages

Lecture

Lecture

22 pages

Lecture

Lecture

13 pages

Lecture

Lecture

24 pages

Lecture9

Lecture9

38 pages

lecture

lecture

26 pages

lecture

lecture

13 pages

Lecture

Lecture

5 pages

lecture

lecture

18 pages

lecture

lecture

22 pages

Boosting

Boosting

11 pages

lecture

lecture

16 pages

lecture

lecture

20 pages

Lecture

Lecture

20 pages

Lecture

Lecture

39 pages

Lecture

Lecture

14 pages

Lecture

Lecture

18 pages

Lecture

Lecture

13 pages

Exam

Exam

10 pages

Lecture

Lecture

27 pages

Lecture

Lecture

15 pages

Lecture

Lecture

24 pages

Lecture

Lecture

16 pages

Lecture

Lecture

23 pages

Lecture6

Lecture6

28 pages

Notes

Notes

34 pages

lecture

lecture

15 pages

Midterm

Midterm

11 pages

lecture

lecture

11 pages

lecture

lecture

23 pages

Boosting

Boosting

35 pages

Lecture

Lecture

49 pages

Lecture

Lecture

22 pages

Lecture

Lecture

16 pages

Lecture

Lecture

18 pages

Lecture

Lecture

35 pages

lecture

lecture

22 pages

lecture

lecture

24 pages

Midterm

Midterm

17 pages

exam

exam

15 pages

Lecture12

Lecture12

32 pages

lecture

lecture

19 pages

Lecture

Lecture

32 pages

boosting

boosting

11 pages

pca-mdps

pca-mdps

56 pages

bns

bns

45 pages

mdps

mdps

42 pages

svms

svms

10 pages

Notes

Notes

12 pages

lecture

lecture

42 pages

lecture

lecture

29 pages

lecture

lecture

15 pages

Lecture

Lecture

12 pages

Lecture

Lecture

24 pages

Lecture

Lecture

22 pages

Midterm

Midterm

5 pages

mdps-rl

mdps-rl

26 pages

Load more
Download Computational Learning Theory
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Computational Learning Theory and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Computational Learning Theory and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?