版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進行舉報或認領(lǐng)
文檔簡介
providedbyPurdueE-Viewmetadata,citationandsimilarpapersat broughttoyoubyprovidedbyPurdueE-PurduePurduee-DepartmentofComputerScienceTechnical
DepartmentofComputerJohnR.PurdueUniversity,Report74-Rice,JohnR.,"TheAlgorithmSelectionProblem—AbstractModels"(1974).DepartmentofComputerScienceTechnicalReports.Paper68.ThisdocumenthasbeenmadeavailablethroughPurduee-Pubs,aserviceofthePurdueUniversityLibraries.Pleasecontactepubs@foradditionalinformation.\\THEALGORITHMSELECTIONPROBLEM-ABSTRACTJohnR,ComputerScienceDepart亞ntPurdueUniversityWestLafayette,Indiana CSD-TR1 Theproblemofselectinganeffectiveorgoodorbestalgorithmarisesinawidevarietyofsituations, Thecontextofthesesituationsoftenobscuresthecommonfeaturesofthisselectionproblemandthepurposeofthisreportistoformulateabstractmodelsappropriateforconsideringit, Withintheframeworkestablishedbythesemodelswepresentavarietyofqueationsthatcan(andusuallyshould)beaskedinanyspecificapplication,1Itshouldbemadeclearthatwedonotbelievetha七theaemodelswillleaddirectly(bysimplespecialization)tosuperiorselectionprocedures,Thiswill alwaysrequireexploitationofthespecificnatureofthesitua-tionathand. Evenso, wedobelievethatthesemodelswillclarifytheconsiderationofthisproblemand,inparticular,showthatsomeapproachesusedarebasedonnaiveass皿ptionsabou亡theselectionassumption,Thisisthefirstofa'seriesofreportswhichconsiderthefollow土ngAbetract沁ConcreteNumericalAnalysis-SelectionofQuadratureAlgorithmsOperatingSystems-SelectionofSchedulingAlgorithmsArtificialIntelligence-LearningAlgorithmsApproximationTheoryforSelectionProceduresComputationofSelectionProceduresThethreeconcreteexampleswhichthereadercanusetointerprettheabstractionsinthisreportmaybesummarizedasfollows: Oneisgivenafunctionf(x),,aninterval[a,b]andtolerancee> OneistoselectanalgorithmtoJbf(x)dxwhichisefficient(usesfewevaluationsoff(x))andreliableanestimatewithinthespecifiedo: Oneisgivenanenvironmentforalargecomputeroperation, Informationknownj;ncludesthemixofjobsbetweenbatch,interactiveandsemi-interactive,somebasiccharacteristicsoftheseclassesofjobsandthecharacteristicsofthecomputeroperation. Oneistoselectanalgorithmtoscheduletheexecutionofthesejobswhichpro-duce(a)highbatchthroughput,(b)goodresponsetointeractivejobs,(c)goodservicetosemi-inte0activejobsand(d)highpriorityArtificial互t斗上拉竺:OneisgivenadescriptionofthegameTic-Tac- Oneistoselectanalgorithmtoplaythegamewhicheffective,i,e,neverlosesandwinswheneveranopponent'smistake
Aselectionprocedureisinvariablyobtainedbyassigningvalues22parametersingeneral"form". Moreprecisely,theselectionprocedure isanalgorithmandaspecificclassischosenwithfreeparametersandtheseparametersarethenchosensoastosatisfy(aswellastheycan)theobjectivesoftheselectionproblem. Classicalformsincludethingslikepolynomials(withcoefficientsasparameters)andlinearmappings(withmatrixcoefficientsorweightsasparameters). Otherrelevantformsaredecisiontrees(withsize,shapeandindividualdecisionelementsaaparameters)andprogram?(withvariousprogramelementsasparameters).ThemodelspresentedhereareprimarilyaimedatalgorithmproblemswiththefollowingthreeProblemS巴竺.:Thesetofproble畫involvedisverylargeandquite Thissetisofhighdimensioninthesenaethatthereareanumberofindependentcharacteristicsoftheproblemswhichareimportan七forthealgor扛血selectionandperformance. Thereiausuallyconsiderablyun-cer七aintyabouttheaecharacteristic?andtheir3 :Thesetofalgorithmsthatneedstobe3islargeanddiverse. Ideallytheremaybemillionsofalgorithmsandprac-ticallytheremaybedozensofthem. Incountingalgorithmswedonotdistinguishbetweentwowhichareidenticalexceptforthevalueofsomenumericparameter. Againthissetisofhighdim巳nsionsandthereisuncertaintyabouttheinfluence.ofalgorithmcharacteristics.PerfomanceMeasure: Thecriteriatomeasuretheperformanceofaparticularalgorithmforaparticularproblemarecomplexandhardtocom-pare(e.g.onewantsfastexecution,highaccuracyandsimplicity). thereisconsiderableuncertaintyinassigningandinterpretingtheseTHEBASICMODEL. WedescribethebasicabstractmodelbythediagraminFigure1. Theitemeinthismodelaredefinedbelowindetail soastobecompletelyclearaboutthenatureofthemodel.xE
4PROBLEM 4n\ Schematicdiagramofthebasicmodelforthealgorithmselectionproblem. Theobjectiveistodetermine soastohavehighalgorithmDefinitionsforthebasic夕?Problemapaceorx?Memberof務(wù)problemtobe AlgorithmapaceorA?Memberof過',algor扛hmapplicabletoproblemsfromS?Mappingfrom夕to矣n?n-dimenaionalrealvectorspaceofperformance Mappingfrom過x夕to5iindete五iningperformanceIIII=Normon劣nprovidiJlgonenumber七oevaluateanperformanceonaparticularForcompletenesswenowstate Qivenall theotheritemsintheabove Theremustbe, ofcourse,'somecri七eriaforthisselectionandwepresentfourprimaryonesbelow:BestSelection. Choosethatselectionmappin B(x)whichgivesmaximumperformanceforeachalgorithm:JJp(B(x),x)II之11p(A,x)| for BestSelectionforaSubclassof Oneistochooseonealgorithmtoapplytoeverymemberofasubclass名CthatselectionmappingS{x) degradationformembersof務(wù)(comparedtochoosingm立Ilp(B(x),x)II
-llp(A。),x)111三ma_:<_llfr(B(x),x)xEfor
-//p(A,x)/55BestSelectionfromaSubclassofMa過堅 Oneistorestrict亡mappingS tobeofacertainformorfromacertainsubclass$飛。* mappingfrom夕to過.ChoosethatselectionmappingS 夕0whichminimizestheperformancedegradationfor membersofmax[llp(B(x),xl'II-IIP(S*(x),x)lll三max[llp(B(x),x)II-IIP(S(x),x)lllforallSE*BestSelectionfromaSubclassofMa過堅sandProblems.Oneistochoosejustonealgorithmfromasubclass9cjtoapplyeverymemberofasubclass9l,立Choosethatselectionmappings~(x)fromYe,whichminimizes七heperformancedegradationforallmembersof令*max_[llp(B(x),xII-llp(s"(x),x)lllminmax[llp(B(x),x)II-llp(S(x),x)lll 6Thesefourcriteriadonotexhaustthemeaningfulcriteriabuttheydoillustratetheprincipalideas. Therearefivemainstepstotheanalysisandsolutionof'thealgorithmselectionproblemasfollows6江 Determinationofthesubclassesofandmappingstobe還聲(Exis七 Doesabestselectionmapping Isthereauniquebestselectionmapping? Whatpropertiescharacterizethebestselectionmappingandservetoidentifyit? WhatmethodscanbeusedtoactuallythebestselectionThereaderfamiliarwiththetheoryofapproximationoffunctions observethatthisframeworkisfa口iliarandthatwemayputthatclassicaltheorywithinthis Thespace夕isafunctionandthealgorithmspacef¥maybeidentifiedwithasubspaceof夕algorithmentersaathemeansofevaluatingelementsof mappingp(A,x) Ilx(t)-A(t)夕wherethenormistakenon夕.Thustheperformancemeasurespace劣1andthenormmappingisTherearetworemarksneededaboutthisobservation. First,thebodyofsignificantmaterielinapproximationtheoryislarge, Itwouldrequire,nodoubt,from2000to4000pagestopresentareasonablycom-pleteandconciseexpositionoftheresultscurrentlyknown, impliesthatthereisaveryrichbodyofmaterialwaitingtobeappliedtothealgorithmselectionproblem,eitherdirectlyorbyanalogy, andmoreimportant,thealgorithmselectionproblemisanessentialexten-7sionandgeneralizationofapproximationtheory.Wewillseeconcreteexamplesofthisproblemwhere七hecurrent七heoryofapproximationhasnothingrelevanttoapplyexceptbythefaintestanalogies,7Wenextpresenttwoconcreteexamplestoillustratethis (AQuadratureproblem). Givenf(x)Ec-[O,l]and E>0, f。x(t)dxwithinEbyacompositeNewton-Cotesformulaofdegreekandwith兒pointswithaminimumnumberofevaluationsof We 夕=c4[0,1]x 12(whereIdenotesthepositiveintegers)na1intheperformancemeasurespaceWechoosetwo各={x(t)Ix(t)hasatmos七1inflection linearfunctionof x(O),x(l/3),x(2/3)andThusS(x)wouldhavethegeneralformwith10parame七rfdcserer\il!ehtes0Ossss11 rfdcserer\il!ehtes0Ossss11 (upahrtxs。丿丿(()ot(Ea0sch/-s(、丿)ot(Ea0sch/-s(、丿( (Asgameplayingproblem). Weare todeviseanalgorichmforplayingTic-Tac-Toe. Theproblemspaeisthesetofpartialgamesof Whilethisnumberislarge,thereareinfactonly28distinctreasonablegamesif oneeliminatesblunders,symmetriesandboardrotations,Theapace mayberepresentedasaspaceoflargetablesofresponsesforeachsituation. However,werestrictourselectiontoadecisiontreethatinvolvesonlytheexistenceofimmediatewinningpositionsandvacant7 ThealgorithmformmaythenberepresentedasshowninFigure7Thereare30parameters inthisformoftheselectionmappingtakeonthevalues"yes"or Only15oftheseare addition七here·are16parametersa,whichtakeononeofthefollowingfivePlaythewinningBlocktheopponent'sPlayinthecenterPlayinacorner(firstfreeoneclockwisefromupper Playinaside(firstfreeoneclockwisefromDoIhaveawinningposition Doesopponenthavea IsthecenterIsacornerS5:r心 TheformoftheselectionmappingfortheTic-Tac-Toe EachSij扭a"yes"or"no"andeachaiisoneoffivemoves.8Anexaminationofthisgameshowsthatwehavebeenoverlyelaborate8Thuswemayassigns11?"yes"and\z?"no"andthenaiMove1i1,2,...,8iscertainlycalledfor.However,itisstillofinteresttoreflectuponhowonewouldcomputethisifonehadnoaprioriinfor~mationabout七hegame. Anexaminationofvariousinstancesofthealgorithmselectionproblemshowsthatthereisanotheringredientalmostalwayspresent. Itissometimesexplicitandsometimesno七andwecallthisselectionbasedonfeaturesoftheproblem. modelisdescribedbythediagrsminFigure3.f(x)E夕
AEAE
PE99IIpII=ALGORITHM diagramofthemodelwithselectionbasedonfeaturesoftheproblem.Theadditionaldefinitionsforthismodel夕=Featurespaceidentifiedwith劣mheretosuggestit issimplerandof1叩erdimensionthan夕.F?Mappingfrom少to夕whichassociatesfeatureswithNotethattheselectionmappingnowdependsonlyonthefeaturesf(x)butyettheperformancemappingstilldependsontheproblemx, Theintroduc-tionoffeaturesmaybeviewedasawaytosystematizethein七roductionproblemsubclassesinthebasicThepreviousstatementofthealgorithmselectionproblemandthe forselectionarestill validforthisnewmodelaswellasthefivestepsintheanalysisandsolutionoftheproblem. Thedeter-minationofthefeaturestobeusedisfrequentlypartoftheprocess,oftenoneofthemostimportantparts. Onemayviewthefeaturesasanattempttointroduceanapproximatecoordinatesystemin9. thoseproblemswiththesamefeatur七swouldhavethesameperformanceforanyalgorithmbeingconsidered. Sincethisidealisrarelyachieved,wemayposeaeveralspecificquestionsaboutthedeterminationof-BestFeatur七sfoo_a;Prtieular杜 Giv,analgorithmAandthedimensionmof夕,whatmfeaturesarethebestforthepredic-tion?oftheperformanceofA. Let_.儀f)denotetheequivalenceclassofall thoseproblamsx,yE夕的thatF(x)?F(y) Wethenwishtodeterminethe*場(f)*
and
ciatedequivalenced_(A) fE yE丘
IIP(A,x)-p(A,y)11三fE
IIP(A,x)-p(A,y)Theselectionofbestfeaturescorrespondstotheselectionofapproximatingsubspacesinapproximationtheo巧?andleadsonetoideas*n-widthsandentropyoftheproblemspace
Roughlyspeaking, d_is江then·theeffectivedimensionof夕(fortheproblemathand)isprobably*largerthanmand,conversely, d_issmallthentheeffectiveof夕扭closetoBestFeaturesforaClassof Givenaandthedimensionmof鄉(xiāng) whatmfeaturesarethebestforpredictionoftheperformanceofalgorithmAE? Withthepreviousnotationwewishto
neF?
場夕(f)so*d(過。 fE夕AE過 x,YE場
IIP(A,x)-p(A,y)< Ilp(A,x)-p(A,y)fE歹AE.J:I x,yE場 BestFeaturesforaSubclassofSelectionMappings. Givenasubclass夕。ofselec己onmappingsfrom夕to.9Jf,whatmfeaturesare七hebestforpredi吐ionoftheperformanceofalgorithms? Withtheprevious notationwewishtodetermine and丘 so*dm(夕。)= fE
m刁SE夕
X,YE場
Ilp(S(f),x)-p(S(f),y)I
Ilp(S(f),x)-p(S(f),Y)IfE
SE夕Thedetermina七ionofthebest(orevengood}featuresisoneofthemostimportant,yetnebulous,aspectsofthealgorithmselectionproblem.Manyproblemspaces夕areknownonlyinvaguetermsandhenceanexperimentalapproachisoftenusedtoevaluatetheperformanceofalgorithmsover夕.Thatis,onechoosesasamplefrom夕andrestrictsconsiderationstothissample. Anappropriatesampleisobviou吐ycrucialtothisapproachandif onehasagoodsetoffeaturesfor夕.thenonecanatleastforcethesampletoberepresentativewithrespecttothesefeatures. Notethatthedefinitionofbestfeatures-issuchthattheyaretheitemsofinfor-mationmostrelevanttotheperformanceofalgorithmsfortheproblematInsomewellunderstoodareas.ofcomputationthereisagenerallyagreedupon(if notexplicitlystated)setoffea七ures. Forexample,considertheproblemofsolvingalinearsystemAx?bofequations. Thefeaturesin-cludedescriptorslike: smallorder,sparse,band,diagonallydominant,positivedefinite,ill-conditioned,etc. Givenvaluesforthesefesturesanexperiencednumericalanalystcanselectanappropriatealgorithmthisproblemwithconsiderable Theselectionproblemforratureisalreadymuchmoredifficult andthesolutionofsimultaneoussystemsofnonlinearequationsisverypoorlyunderstood. Ifthissituationexistsforproblems七hathavebeenstudiedforoneortwocenturiesthenoneshouldnotbesurprisedbythedifficultiesanduncertaintiesforproblemsthathavejustappearedinthepastoneortwoALTERNATEDEFINIT Iheprecedingsectionswehaveuniformlytakenaminimaxapproachtothedefinitionofbestoroptimumselection. Thatis,wehaveminimizedtheeffectoftheworstcase.Itisreasonabletoignoretheperformancefortheworstcaseand,instead,con吐deroptimizingsomesortofaveragebehavior. Inthissectionweex-hibittheresultingmathematicalproblemscorrespondingtousingaleastsquaresorleastdeviationapproach(thesecorrespondtoL2andL1optimiza-tioninmathematicalterms). WehaveidentifiedsevenproblemslabelAthroughG. ProblemAisunaffectedbytheseconsiderationssoletuscon-sider紅oblemB: BestSelectionforaSubclassofProblems. Weuse notationintroducedwiththeoriginalmathematicalstatementofthisprob-lemwhichMinimax rllp(B(x),x)II-
Ilp(A*,xll]l三 [|lp(B(x),x)|XE夕
-Ilp(A,x)IIfor AEThecorrespondingmathematicalstatementsfortheleastsquaresandleastdeviationapproachare:罕f_[IIP(B(x),x)II-forallAE
LeastDeviations勻 jjp(A?,xlllldx三歲ol11p(B(x),xlll-for AETheuseofintegralsintheseformulationsimpliesthatatopologyhasbeenintroducedintheproblemspace夕.Manycommonexample臼for夕aredis-creteinnatureandinthesecasesthetopologyintroducedreducestheintegralstosums. Thiatechnicalityisunlikelytocauserealdifficultiesandwecontinuetouseintegralsasthisgivestheneatestformulations.Notethattheonlydifferencebetweenthetwonewformulationsis (2or1)intheintegrand. Thuswemayavoidrepeatingthesefo亡mulationstwicebymakingthisavariable,sayr, whichhasvalues1or2,Notethatinapproximationtheoryit isshownthatminimaxisthelimitingcaseasr+mso thatall threeapproachescanbeexpressedinoneformula-tionwithrasaparameter.RecallthatProblemCistheBeatSelectionfromaSubclassofMa匹蟲逞Thealternativemathematicalformulationofthisproblem』||p(B(x),x)I/-1/p(S。(x),x)I/rdx三占11/p(B(x),x)Ifor SE夕ThealternativeformulationforProblemDisidenticaltothisexceptthattheproblemsubcla的氣replace夕asthedomainofintegration.Thenextthreeproblemsinvolvefeaturesandwechoosetouseacon-sistentapproachfor七he That weuseleastontheproblemspacewealsouseitonthefeaturespace夕and亡hespace立.Ifwed:(A,歲 fE
x,y
Ilp(A,x)-p(A,y)|
thenforProblem BestFeatureforaPar .the*istofindthefeaturemappingF?andassociatedequivalenceclasses礦whichminimized:(A, m心?d:(A,豆·臣d:(A,歲Fo工ProblemFwed;(Wo·爐)一
J IIP(A,x)-p(A,y)11fE歹AE..Ql'ox,y鄒 thentheobjectiveistodetermineF*..and
歲
so滬。)=d;(叱,礦)=臣nd;心。,Asimilarapproachto yieldsasimilarexpressionexceptthattheintegralover isreplacedbyanintegraloverYa· manypracticalproblemsthereislittletoguideoneintheofaparticularformulationofthemathematicaloptimizationproblem,i.e.shouldwechooser=1, 2or00? Thesechoicesmightnotbeparticularlysignificantinthelargercontext,buttheyareverysignificantindeterminingthedifficultyoftheresultingmathematicaloptimizationproblem. Alessonlearnedfrompracticalapproximationtheorymightbeapplicableinthislarger Thislessonis,roughly,tha七thecrucialingredientsforsuccessareproperchoicesofthesubclasses夕0'%。and Oncethesearemadeproperlythenthemathematicaloptimhationshouldbemadeforthatvalueof thatgivestheleastdifficul七y. Iftheproblemiscompletelylinearthen 2(leastsquares)almostalwaysresultsintheleastmathematicaldiffi- Thesituationisvariablefornonlinearproblems. Notethattherearepracticalapproximationproblemswherethechoiceofriscrucialandnodoubttherearesimilarcasesforthealgorithmselectionproblem.Wearesayingthatthechoiceofrisimportantonlyinaninfrequentnumberofinstances.THEMODELWITHVARIABLEPERFOR四CECRITERIA. Wehaveaaaumedaofarthatthereissfixed口aytome88uretheperformanceofaparticularalgorithmforaparticularproblem. Thereare,however,manysituationswhereit isreasonabletoviewtheperformancecriteriaasinputtotheselectionproblem, Consider,forexample,theselectionofaprogramtosolveordinarydifferentialequationsand七hecriteriaofaccuracy,reliability,andcareofuse, Indifferentsituationstheweightgiventoeachofthesemightvaryfromalmostzerotoalmost100%,AmodelforthisversionoftheselectionproblemisshowninthediagramofFigure4,XE
f(x)ef(x)eFE應(yīng)
I
四nPEIIPII= SchematicdiagramofthemodelwithselectionbasedonfeaturesandvariableperformanceTheadditionaldefinitionforthismodelgNormfunctionfrom礦x劣ntoRlwhichmeasurestheperformancep(A,x)withthecriteriaSomeofthemappingsnowhavechangeddomains,buttheirna七ureisthesame.Thechoiceof劣nforthecriteriaspaceisclearlyarbitrary(andperhapsunnecessarilyrestrictive)butit isn
溫馨提示
- 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫網(wǎng)僅提供信息存儲空間,僅對用戶上傳內(nèi)容的表現(xiàn)方式做保護處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負責。
- 6. 下載文件中如有侵權(quán)或不適當內(nèi)容,請與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準確性、安全性和完整性, 同時也不承擔用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。
最新文檔
- 萬能版學生期末總結(jié)(23篇)
- 廣東廣州鐵路職業(yè)技術(shù)學院引進急需專業(yè)人才真題
- 南充市高坪區(qū)考核招聘研究生和部屬公費師范畢業(yè)生考試試卷及答案
- 初中語文期末作文預(yù)測范文《成長》
- 三毛流浪記讀后感800字
- 范文新學期的計劃范文匯編6篇
- 父母感恩演講稿范文集合10篇
- 父母感恩演講稿范文集錦九篇
- 2020年江蘇鎮(zhèn)江中考滿分作文《查》5
- 金屬制品在數(shù)據(jù)中心消防中的應(yīng)用考核試卷
- 化水通用設(shè)備基本檢修工藝及其有關(guān)知識
- 110KV變電站運行費用表
- 高壓清洗機安全操作制度
- 中歷史課堂教學的不同課型的基本方法和要求
- 餐飲服務(wù)單位臺賬樣本8項
- 單位公務(wù)用車加油登記表格模板正式版
- 蘇教版小學六年級科學上冊《火山與地震》
- 部編版小學語文四年級上冊第五單元《習作例文(我家的杏熟了)》第一課時課件
- 廣東省交通集團高速公路營運管理規(guī)范
- 校服發(fā)布主持稿(202103)
- 檢驗科醫(yī)院感染危險風險評估
評論
0/150
提交評論