+ All Categories
Home > Documents > INF3490/4490 Autumn 2018 - UiO

INF3490/4490 Autumn 2018 - UiO

Date post: 13-Feb-2022
Category:
Upload: others
View: 5 times
Download: 0 times
Share this document with a friend
31
INF3490/4490-Autumn 2018 1/31 INF3490/4490 Autumn 2018 INF3490/4490 — Biologically Inspired Computing November 30th, 2018 Exam hours: 09:00 – 13:00 Permitted materials: None The course teachers will visit the exam room at least once during the exam. The exam text consists of problems 1-40 (multiple choice questions) to be answered by selecting true or false for each statement. If you think a statement could be either true or false, consider the most likely use/case. Problems 41-43 are answered by entering text (preferably in English language). Problems 1-40 have a total weight of 80%, while problems 41-43 have a weight of 20%. Scoring in multiple choice questions Each problem has a variable number of true statements, but there is always one true and one false statement for each problem. 0.5 point is given for each correctly marked statement. Further, an incorrectly marked statement or an unmarked statement(s) results in 0 point. The maximum score for a question is 2 points and the minimum is 0. Since it is possible to get a positive score just by random answering, the final grading thresholds will be adjusted accordingly. 1 1 Optimization Algorithms Which optimization algorithm(s) can guarantee to find the best solution in any search landscape? Evolutionary algorithms Select an alternative Hillclimbing / Local Search Select an alternative Exhaustive Search Select an alternative Gradient Descent Select an alternative: True False False True False True True False Maximum marks: 2
Transcript

INF3490/4490-Autumn2018

1/31

INF3490/4490Autumn2018INF3490/4490—BiologicallyInspiredComputing

November30th,2018Examhours:09:00–13:00Permittedmaterials:NoneThecourseteacherswillvisittheexamroomatleastonceduringtheexam.Theexamtextconsistsofproblems1-40(multiplechoicequestions)tobeansweredbyselectingtrueorfalseforeachstatement.Ifyouthinkastatementcouldbeeithertrueorfalse,considerthemostlikelyuse/case.Problems41-43areansweredbyenteringtext(preferablyinEnglishlanguage).Problems1-40haveatotalweightof80%,whileproblems41-43haveaweightof20%.ScoringinmultiplechoicequestionsEachproblemhasavariablenumberoftruestatements,butthereisalwaysonetrueandonefalsestatementforeachproblem.0.5pointisgivenforeachcorrectlymarkedstatement.Further,anincorrectlymarkedstatementoranunmarkedstatement(s)resultsin0point.Themaximumscoreforaquestionis2pointsandtheminimumis0.Sinceitispossibletogetapositivescorejustbyrandomanswering,thefinalgradingthresholdswillbeadjustedaccordingly.

1 1OptimizationAlgorithmsWhichoptimizationalgorithm(s)canguaranteetofindthebestsolutioninanysearchlandscape?EvolutionaryalgorithmsSelectanalternative

Hillclimbing/LocalSearchSelectanalternative

ExhaustiveSearchSelectanalternative

GradientDescentSelectanalternative:

True

False

False

True

False

True

True

False

Maximummarks:2

INF3490/4490-Autumn2018

2/31

2 2ExplorationWhichis/aretrueaboutexplorationExplorationisonlyusedforcontinuousoptimizationSelectanalternative:

ExplorationisonlyusedfordiscreteoptimizationSelectanalternative

ExhaustivesearchisapurelyexploratorytechniqueSelectanalternative

HillclimbingisapurelyexploratorytechniqueSelectanalternative

True

False

True

False

False

True

False

True

Maximummarks:2

3 3OptimizationAlgorithmsOptimizationalgorithmsSimulatedannealingbalancesexploitationandexplorationwiththetemperatureparameterSelectanalternative:

GradientdescentcanbeusedforcontinuousoptimizationSelectanalternative

Gradientdescentfocusesmoreonexplorationthanexploitation

Selectanalternative

True

False

True

False

INF3490/4490-Autumn2018

3/31

Selectanalternative

SimulatedannealingonlyselectsneighborsolutionsthatarebetterthanthecurrentsolutionSelectanalternative

False

True

True

False

Maximummarks:2

4 4EvolutionaryAlgorithmsWhichis/arepartsofevolutionaryalgorithms?VariationoperatorsSelectanalternative:

ApopulationSelectanalternative

AnannealingscheduleSelectanalternative

AmomentumSelectanalternative

True

False

False

True

True

False

False

True

Maximummarks:2

5 5PermutationrepresentationWhichproperty/propertiesdoweoftenaimtoconservewhenapplyingvariationoperatorstogenotypesrepresentedaspermutations?

INF3490/4490-Autumn2018

4/31

TemperatureSelectanalternative:

AdjacencySelectanalternative

GradientsSelectanalternative

OrderSelectanalternative

False

True

True

False

False

True

False

True

Maximummarks:2

6 6BinarygenotypeForwhichproblem(s)wouldabinarygenotypebeanaturalchoice?Theknapsackproblem:Givenndifferentobjects,eachwithaknownweightwiandvaluevi,andaknapsackwithagivencapacityW,filltheknapsackwiththoseobjectsmaximizingitstotalvalue,whilestayingwithintheweightcapacity.Selectanalternative:

ThetravellingsalesmanproblemSelectanalternative

Optimizingtheshapeofanairplane'swings:GivenNdifferentpositionalongthewing,optimizetheheightandthicknessofthewingateachofthosepositions.Selectanalternative

False

True

True

False

True

False

INF3490/4490-Autumn2018

5/31

Optimizingarecipebyselectingasubsetfromalistofingredients.E.g.fromthelist[cheese,bacon,eggs,bread]onerecipe(anindividual)couldbe[eggs,bread]Selectanalternative

False

True

Maximummarks:2

7 7SelectionSelectioninEvolutionaryAlgorithmsEvolutionaryalgorithmsalwaysselecttheindividualwiththehighestfitnessSelectanalternative:

EvolutionaryalgorithmswithparentselectiondonotneedsurvivorselectionSelectanalternative

Intournamentselection,largertournamentsizesresultinahigherselectionpressureSelectanalternative

StochasticuniversalsamplingisaformoffitnessproportionateselectionSelectanalternative

True

False

False

True

True

False

False

True

Maximummarks:2

8 8DiversityWhichis/aremethod(s)toencouragediversityinevolutionaryalgorithms?Speciation

Selectanalternative:

INF3490/4490-Autumn2018

6/31

Selectanalternative:

CrowdingSelectanalternative

FitnessSharingSelectanalternative

ElitismSelectanalternative

True

False

True

False

False

True

True

False

Maximummarks:2

9 9EvolutionStrategiesWhichgenotype(s)is/aretypicallyappliedinevolutionstrategies?Listsoffloating-pointnumbersSelectanalternative:

Asinglefloating-pointnumberSelectanalternative

PermutationsSelectanalternative

True

False

False

True

True

False

INF3490/4490-Autumn2018

7/31

ListsofbinarynumbersSelectanalternative

True

False

Maximummarks:2

10 10EvolutionaryAlgorithmsubtypesWhichis/areasubtypeofEvolutionaryAlgorithm?GeneticProgrammingSelectanalternative:

EvolutionaryProgrammingSelectanalternative

SimulatedAnnealingSelectanalternative

HillclimbingSelectanalternative

False

True

False

True

False

True

True

False

Maximummarks:2

11 11PerformancemeasurementsforevolutionaryalgorithmsWhichis/aretrueaboutperformancemeasurementsforevolutionaryalgorithms?Ondesignproblems,wecaremoreaboutpeakperformancethanworst-caseperformance

Selectanalternative:

INF3490/4490-Autumn2018

8/31

Selectanalternative:

Onrepetetiveproblems,wecaremoreaboutpeakperformancethanworst-caseperformanceSelectanalternative

Thesuccessrateofanevolutionaryalgorithmismeasuredbytakingthemedianfitnessofthebestindividualintheendofarun,andaveragingthatacrossNdifferentrunsSelectanalternative

Tocomparetheperformanceofdifferentevolutionaryalgorithms,weneedtoperformseveralindependentrunsofeachofthemSelectanalternative

False

True

False

True

False

True

True

False

Maximummarks:2

12 12DesignProblemsWhichis/aretrueaboutdesignproblemsEveryday,IKEAoptimizesthenumberofmeatballstoproduce,dependingontheexpectednumberofvisitorsestimatedwithfactorssuchasweather,seasonalchanges,etc.Thismeatballoptimizationisanexampleofadesignproblem.Selectanalternative:

ThecostsofcarryingouttheoptimizedplanisusuallyfargreaterthanthecostofcomputingitSelectanalternative

Wecanusuallydomultiplerunsoftheoptimizationalgorithmwhensolvingadesignproblem

Selectanalternative

False

True

True

False

INF3490/4490-Autumn2018

9/31

Selectanalternative

OnlyevolutionaryalgorithmscansolvedesignproblemsSelectanalternative

False

True

True

False

Maximummarks:2

13 13MultiobjectiveevolutionaryalgorithmsWhichdifferbetweenmultiobjectiveandsingle-objectiveevolutionaryalgorithms?GeneticrepresentationsSelectanalternative:

VariationoperatorsSelectanalternative

ThemethodforselectingindividualsforthenextgenerationSelectanalternative

DiversitymaintenanceSelectanalternative

False

True

False

True

True

False

True

False

INF3490/4490-Autumn2018

10/31

Maximummarks:2

14 14MachinelearningWhatistrueaboutmachinelearning?MachinelearningtypicallyworksbestwithsmallamountsofdataSelectanalternative:

GeneralizationinmachinelearningmeanslearningtohandledatanotseenduringtrainingSelectanalternative

Machinelearningisiterative,typicallyrequiringtrainingoneachdatapointmorethanonceSelectanalternative

MachinelearningsystemscanneveroutperformhumanexpertsSelectanalternative

False

True

False

True

False

True

False

True

Maximummarks:2

15 15SupervisedlearningWhichis/aretrueforsupervisedlearning?SupervisedlearningrequiresatargetoutputforeachtrainingsampleSelectanalternative:

Classificationandregressioncanbesupervisedlearningtasks

Selectanalternative

True

False

INF3490/4490-Autumn2018

11/31

Selectanalternative

LearningtoplaychessbyplayingmatchesagainstanopponentisanexampleofsupervisedlearningSelectanalternative

LearningtorecognizedogsinimagesbyanalyzingimageslabelledwiththeircontentisanexampleofsupervisedlearningSelectanalternative

False

True

True

False

True

False

Maximummarks:2

16 16NeuralNetworksWhichis/aretrueaboutneuralnetworks?McCullochandPittsNeuronspreciselyreplicatechemicalprocessesinsidebiologicalneuronsSelectanalternative:

ThefirstartificialneuralnetworkstypicallyappliedasigmoidfunctionasactivationfunctionSelectanalternative

AssembliesofneuronsarecapableofuniversalcomputationSelectanalternative

PerceptronshavemultiplehiddenlayersSelectanalternative

False

True

False

True

True

False

True

False

INF3490/4490-Autumn2018

12/31

Maximummarks:2

17 17PerceptronlearningruleWhichareelementsintheperceptronlearningrule?Alearningrate,ηSelectanalternative:

Theneuron'sinput,xiSelectanalternative

Theerrorattheoutput,(ti-yi)

Selectanalternative

Thepreviousweightupdate,Δwij

Selectanalternative

False

True

False

True

False

True

True

False

Maximummarks:2

18 18NeuralnetworksWhichis/aretrueaboutneuralnetworks?PerceptronsarelimitedtolearninglinearlyseparableproblemsSelectanalternative:

False

True

INF3490/4490-Autumn2018

13/31

DifferentlayersmayapplydifferentactivationfunctionsSelectanalternative

MultilayerneuralnetworkslearnbyonlyadjustingweightsattheoutputlayerSelectanalternative

Gradientdescent-basedtrainingislimitedtotrainingneuralnetworkswithuptoonehiddenlayerSelectanalternative

True

False

False

True

True

False

Maximummarks:2

19 19BackpropagationWhatistrueaboutbackpropagation?WeightsareupdatedintheforwardphaseSelectanalternative:

DeltasaremultipliedbyweightsastheyarepropagatedbackwardsthroughanetworkSelectanalternative

BackpropagationcanbeappliedwhenusingathresholdactivationfunctionSelectanalternative

Backpropagationneverchangestheweightsconnectedtotheoutputsoftheneuralnetwork

Selectanalternative

True

False

True

False

True

False

INF3490/4490-Autumn2018

14/31

Selectanalternative

True

False

Maximummarks:2

20 20TrainingneuralnetworksWhichis/aretrueabouttrainingneuralnetworks?Inbatchtraining,weightsareupdatedaftereverytrainingsampleSelectanalternative

BackpropagationisaformofgradientdescentlearningSelectanalternative

MinibatchtrainingisacompromisebetweensequentialtrainingandbatchtrainingSelectanalternative

Inminibatchtraining,deltasareaccumulatedacrossseveraltrainingsamplesSelectanalternative:

True

False

False

True

False

True

True

False

Maximummarks:2

21 21DecisionboundaryWhatistrueaboutthisdecisionboundary?

INF3490/4490-Autumn2018

15/31

ItisprobablyoverfittingSelectanalternative:

ItwillprobablygeneralizepoorlytonewdataSelectanalternative

ItprobablyshowsperfectperformanceontrainingdataSelectanalternative

ItprobablyshowsperfectperformanceontestdataSelectanalternative

False

True

True

False

False

True

True

False

Maximummarks:2

22 22MultilayerneuralnetworkConsidertheANNbelow.AandBareinputs,Eistheoutputnode,andnumbersindicatetheweightsofconnections.Therearenobiasinputs.Assumeallneuronsapplylinearactivationfunctions,g(u)=u.WeinputthevaluesA=1,B=1.Whichvalue(s)areoutputbyanyofthehiddenneurons?

INF3490/4490-Autumn2018

16/31

-2Selectanalternative:

5Selectanalternative

1Selectanalternative

3Selectanalternative

True

False

True

False

False

True

False

True

Maximummarks:2

23 23ReinforcementLearningInreinforcementLearningTherewardtellsuswhichactionweshouldhavetaken.

Selectanalternative:

INF3490/4490-Autumn2018

17/31

Selectanalternative:

TherewardisneverdelayedSelectanalternative

TherewardisalwaysapositivevalueSelectanalternative

Itispossibletoreceivetheentirerewardattheend.Selectanalternative

False

True

False

True

True

False

False

True

Maximummarks:2

24 24ReinforcementLearningQ-LearningvsSARSAQ-Learningalwaysassumesoptimalaction.Selectanalternative:

SARSAresultsinefficientbutriskysolutions.Selectanalternative

SARSAispureexploitationsearch.Selectanalternative

False

True

False

True

True

False

INF3490/4490-Autumn2018

18/31

Q-learninggeneratessaferresults.Selectanalternative

False

True

Maximummarks:2

25 25ReinforcementLearningTheQ-learningalgorithm:Alwaysassumetheoptimalaction.Selectanalternative:

Followsagreedysearchbehavior.Selectanalternative

Thevalueiscalculatedbyaveragingallpossibleactions.Selectanalternative

Followsastate-valuefunction.Selectanalternative

True

False

False

True

True

False

False

True

Maximummarks:2

26 26DeepLearningDeeplearningIsalwaysanunsupervisedlearningmethod.

Selectanalternative:

INF3490/4490-Autumn2018

19/31

Selectanalternative:

Isusuallyimplementedusinganeuralnetworkarchitecture.Selectanalternative

Networksneedatleastonelayerforeveryinputvariable.Selectanalternative

Requireslotsoftrainingdata.Selectanalternative

False

True

False

True

False

True

False

True

Maximummarks:2

27 27SupportVectorMachinesSupportvectorsFindtheclassificationlineswiththehighestmargin.Selectanalternative:

Canrepresenttheentiredataset.Selectanalternative

Shouldhavethemaximumdistancefromtheseparatorline.Selectanalternative

False

True

True

False

False

True

INF3490/4490-Autumn2018

20/31

Resultinthesmallestmarginalarea.Selectanalternative

True

False

Maximummarks:2

28 28SupportVectorMachinesSlackvariablesAreusedtominimizethenumberofsupportvectors.Selectanalternative:

Aimtominimizetheclassificationerror.Selectanalternative

Replacetheoriginalvariables(features)innon-linearlyseparableproblems.Selectanalternative

Areusedforlinearly-separableproblems.Selectanalternative

False

True

False

True

False

True

False

True

Maximummarks:2

29 29SupportVectorMachinesKernels

INF3490/4490-Autumn2018

21/31

Kernelsareusedtomaketheinputdatalinearlyseparable.Selectanalternative:

Theobjectiveistominimizethemarginalarea.Selectanalternative

Replacetheinputfeatureswithafunctionofthatfeature.Selectanalternative

Requireaminimalnumberofsupportvectors.Selectanalternative

True

False

True

False

True

False

False

True

Maximummarks:2

30 30EnsembleLearningAdaBoostalgorithmUpdatestheweightsbasedonpreviouserrors.Selectanalternative:

Theweightofeachdatapointisfixedduringthelearning.Selectanalternative

Initially,allweightsareequal.

Selectanalternative

False

True

True

False

INF3490/4490-Autumn2018

22/31

Selectanalternative

Initially,allweightsareselectedasrandomnumbers.Selectanalternative

True

False

False

True

Maximummarks:2

31 31EnsembleLearningInBaggingalgorithmsBootstrapsamplesareusedwithoutreplacement.Selectanalternative:

Eachdatapointisusedonlyinoneoftheclassifiers.Selectanalternative

Theweightofeachdatapointisbasedonitspreviouserror.Selectanalternative

Randomsamplingwithreplacementisusedfortraining.Selectanalternative

False

True

False

True

False

True

True

False

Maximummarks:2

INF3490/4490-Autumn2018

23/31

32 32DimensionalityReductionPrincipalComponentsAnalysisPrincipalcomponentisthedirectioninthedatawiththelowestvariance.Selectanalternative:

Increasesthedimensionofthetrainingdata.Selectanalternative

Sometimesremovesthenoisefromthedata.Selectanalternative

Reducesthecomplexityofthelearningproblem.Selectanalternative

False

True

True

False

True

False

False

True

Maximummarks:2

33 33UnsupervisedLearningInunsupervisedlearningThereisaspecificerrorfunctiontominimize.Selectanalternative:

Thealgorithmsusethedataitselftoguidethelearning.Selectanalternative

True

False

True

False

INF3490/4490-Autumn2018

24/31

Worksbyspottingsimilaritybetweenvariousdatapoints.Selectanalternative

Thedataislabelled.Selectanalternative

True

False

False

True

Maximummarks:2

34 34UnsupervisedLearningInk-meanclusteringalgorithmEachclustercenterisinitiallyselectedrandomly.Selectanalternative:

Thenumberofclustersisunknown.Selectanalternative

Theclustercentersremainfixedduringthealgorithm.Selectanalternative

Thealgorithmcontinuesuntileachdatapointisassignedtoacluster.Selectanalternative

True

False

True

False

False

True

False

True

Maximummarks:2

INF3490/4490-Autumn2018

25/31

35 35UnsupervisedLearningSelf-organizingmapsIsaneuralnetworkwithtopologicalmeaning.Selectanalternative:

Closeneuronsrepresentsimilardatapoints.Selectanalternative

Requiresalargenumberoflabelleddata.Selectanalternative

Eachneuronisonlyconnectedtoaninput.Selectanalternative

False

True

True

False

False

True

False

True

Maximummarks:2

36 36UnsupervisedLearningWhatarethemainessentialprocessesinSelf-OrganizingMaps?CompetitionSelectanalternative:

Addingahiddenlayer.Selectanalternative

True

False

True

False

INF3490/4490-Autumn2018

26/31

CooperationSelectanalternative

Weightadaptation.Selectanalternative

False

True

True

False

Maximummarks:2

37 37SwarmIntelligenceSwarmIntelligenceIsbasedonsimplelocalrulesbetweenagents.Selectanalternative:

Eachagentisindependentandisolatedfromotheragents.Selectanalternative

Theoverallcontrolstructureisdecentralized.Selectanalternative

Thereshouldbeaformoflocalinteractionbetweenagents.Selectanalternative

True

False

True

False

False

True

False

True

Maximummarks:2

INF3490/4490-Autumn2018

27/31

38 38EthicsAsimov'sEthicalGuidelinesforRobotsArobotmustprotectitsownexistenceeventhoughitimpliesharmingahumanbeing.Selectanalternative:

Thelawscanbeconflicting.Selectanalternative

Obeyingordersgivenbyhumanbeingsisthemostimportantlaw.Selectanalternative

ContainalawaboutallrobotshavingaserialnumberSelectanalternative

False

True

False

True

True

False

False

True

Maximummarks:2

39 39EthicsEthicalreasoningconsiderationsEthicalreasoningshouldbebuiltintoasystematdesigntime.Selectanalternative:

Ethicaldecisionsupportsystemscanreducetheriskofunwantedbehavior.Selectanalternative

False

True

True

False

INF3490/4490-Autumn2018

28/31

Nohumaninvolvementisneededifasystemisequippedwithanethicalreasoningengine.Selectanalternative

Designersneedtogiveattentiontopossibleethicalchallengeswhendesigningsystems.Selectanalternative

False

True

False

True

Maximummarks:2

40 40EthicsBlackboxvsglassboxsystemsAblackboxsystemisnormallypreferredcomparedtoglassboxsystem.Selectanalternative:

Thechosenmachinelearningalgorithmimpactswhatkindofboxitrepresents.Selectanalternative

Aglassboxsystemindicatesthatitisasystemthatcaneasilybreakorfail.Selectanalternative

Aglassboxsystemindicatesamoreinspectablesystem.Selectanalternative

True

False

False

True

True

False

True

False

Maximummarks:2

INF3490/4490-Autumn2018

29/31

41 41MachinelearningcategoriesWhichcategoryofmachinelearningiseachofthefollowingtaskssimilarto?Explainwhy,referringtotheavailabilityofdatalabels/reinforcingfeedback:41a.(2%)Trainingadogbygivinghimsnackswheneverheperformsatrick41b.(2%)MemorizingthecapitalsofallEuropeancitiesbystudyinganAtlas41c.(2%)LearningtotellthedifferencebetweenexoticfruitswhileonvacationtoSouthAmerica,butwithoutactuallylearningtheirnamesFillinyouranswerhere

Words:0

Maximummarks:6

42 42FuzzyLogicFuzzylogicsystems42a.(2%)BrieflyexplainthemaindifferencebetweenBooleanlogicandfuzzylogic.42b.(6%)ForthefollowingFuzzysystem,calculatethecrispoutput(y),whentheinputsare(x1=0.8)and(x2=0.3).Usethecenterofgravityfordefuzzification.Reachingthefinalequationof"centerofgravity"issatisfactory,andyoudon'tneedtocalculatethefinalnumericalanswer.


Recommended