Foundation of Machine Learning [Part02]

Foundation of Machine Learning [Part02]

ID:40632100

大小:5.26 MB

页数:47页

时间:2019-08-05

Foundation of Machine Learning [Part02]_第1页
Foundation of Machine Learning [Part02]_第2页
Foundation of Machine Learning [Part02]_第3页
Foundation of Machine Learning [Part02]_第4页
Foundation of Machine Learning [Part02]_第5页
资源描述:

《Foundation of Machine Learning [Part02]》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、FoundationsofMachineLearningLecture2MehryarMohriCourantInstituteandGoogleResearchmohri@cims.nyu.eduPACLearningConcentrationBoundsMotivationSomecomputationallearningquestions•Whatcanbelearnedefficiently?•Whatisinherentlyhardtolearn?•Ageneralmodeloflearning?Complexity•Computationalcomplexity:timeandspa

2、ce.•Samplecomplexity:amountoftrainingdataneededtolearnsuccessfully.•Mistakebounds:numberofmistakesbeforelearningsuccessfully.MehryarMohri-FoundationsofMachineLearningpage3ThislecturePACModelSamplecomplexity-finitehypothesisspace-consistentcaseSamplecomplexity-finitehypothesisspace-inconsistentcaseConc

3、entrationboundsMehryarMohri-FoundationsofMachineLearningpage4DefinitionsX:setofallpossibleinstancesorexamples,e.g.,thesetofallmenandwomencharacterizedbytheirheightandweight.c:X→{0,1}:thetargetconcepttolearn,e.g.,c(x)=0foramale,c(x)=1forafemaleexample.C:conceptclass,asetoftargetconceptsc.D:targetdistr

4、ibution,afixedprobabilitydistributionoverX.TrainingandtestexamplesaredrawnaccordingtoD.MehryarMohri-FoundationsofMachineLearningpage5DefinitionsS:trainingsample.H:setofconcepthypotheses,e.g.,thesetofalllinearclassifiers.ThelearningalgorithmreceivessampleSandselectsahypothesishSfromHapproximatingc.Mehry

5、arMohri-FoundationsofMachineLearningpage6ErrorsTrueerrororgeneralizationerrorofhwithrespecttothetargetconceptcanddistributionD:errorD(h)=Pr[h(x)￿=c(x)].x∼DEmpiricalerror:averageerrorofhonthetrainingdatasampledaccordingtodistributionD,￿m1error￿D(h)=1h(xi)￿=c(xi).mi=1MehryarMohri-FoundationsofMachineL

6、earningpage7PACModel(Valiant,1984)PAClearning:ProbablyApproximatelyCorrectlearning.Definition:conceptclassisCPAC-learnableifthereexistsalearningalgorithmsuchthat:L•forallandalldistributions,c∈C,￿>0,δ>0,DPr[error(hS)≤￿]≥1−δ,S∼D•forsamplesofsizeforafixedSm=poly(1/￿,1/δ)polynomial.MehryarMohri-Foundation

7、sofMachineLearningpage8RemarksConceptclassCisknowntothealgorithm.Distribution-freemodel:noassumptiononD.Bothtrainingandtestexamplesdrawn.∼DProbably:confidence.1−δApproximatelycorrect:accuracy.1−￿Efficie

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。