€ Introduction to deep learning ue ar23, 7:58AM CET v Congratulations! You passed! Ee Introduction to deep learning 80% 1. atest analogy Alister refer? GED © Ais ponscing peso devices nournees ac ofc, smi tole © Prop e-snan gi is deeing aren nave cy © Aranson computes ants ths powered ey bit ls tng computers ig: ot posse etre © simiarto eee staring soou 100 years ago, ls twarstorming multe ndusres. Y conact ‘Yes Alistranstorming many fede rom he car industry to areuture ta supply, 2. When ofthat tons or Deep ening een ting Pha reson tht pe) a== (2 We nave acess toa ot more cata, Y conact ‘Yes! Te prateation of ur soy has played ahugeroleinths. ( eep eacrng nas eaten sigan improvements nimportant ppcatons ach at ane averting speach ‘cognition anamagereagncen. Y Conact ‘These were allexampesdscusseain were 3 © We nave acess toa ot mere compnstionl paver Y correct ‘Yes! The development of hardware, perhaps expec GPU computing ha signcaty improved deep learingalgritms performance, Deut Neri ace bance fa 2. fects pam cf eraing ower: Lies Which fe stems bona Checkalthopch)— ESE Idea amExperiment " Code Deen nie tory oxeiess acy allows dee aig engner to ete moce qu. 1 Faster computation can help speedup hom nga eam talesto erste to 3 good de, Y comect Yo, as discussed intecre 4 1D Wistasterto tain ona ig dataset than asa eataset 1B Becenproeresin deep learning agorthms has sowed uso tan good modes aster even whet chang the (PUIGPU paranare Correct ‘Yes For example we cscussed now witching from sgmald to ReLU actuation unctons lows faster trang. When an experianced ep lamin enghser works on anew problem, thy can usa ute ng fom prevous problems tala» good made onthe frst ty, wou needing to Rest ipa tes tough iret modal O te © rae Correct ‘Yes Finding the characteris of 3 med shay o have ood performance. Aheughexperenc can hep it requres mutipe erator te bul 2 goed mode, Which one of these pots represents a eLU cation function? O FeuerO Faure © Fowes a Z O Fawes a Z Y correct Come Ths the RELY actation unto, the mas Use In neu Newer. 6 images or a recognition an example ot "StucUre” data, because is represeted as a sructred aan GE compute Truefae? Ome © tase Y Comet ‘Yes Image forcat ecagtion ssn example of ursrtires dt,1 musiniin wane sanissvinenanas ies yopionay Sor pe Sa NRA UMN EARS SS UM “Dnstuctured data because contains data coming om fee soures TFs? O twe © fae correct | demographic dataset wih statist on aferen ces population, GD® per capt, economic growths an ‘example of structured data by oposton to image, ouco or text datasets. 1 Why's an RUN (Recerent Neal Network) Used or machine Lansain,sayWansaing Enno Naren co) Deane waines as supe amin problem. 1D tsserety more powerful nan 2 Conlon Neural Network (CAN [ Wisappcabie when te npuvouputis a sequence (eg. a sequence of ores WY Conect ‘Yes. AN ANN can map rom a sequence of engish words toa sequence french words, 1D ns represencine recurrent process odes. Code sperinent tea 8. Inthisclagramwhich wehans.rewin lecture what othe honzenal asad andverialansiyoxs}eprecen? — ED se Oo ‘ass the prformanc ofthe algorithm _yatis etal asthe amount of ta. yas tala) se pertomance othe algo, @® ‘avis the inpu tte gor °° ys ouput. sais the amu of data ° ysis these ofthe model you tran1 Correct 10, Assaing the weds descbedinshe previous quesion’sfeureareacurteandhopingyou atte acsiabesreh QE hin oft ftomig ar re? (nec al at 3907) 2 lrcreasng the sizeof newsl network general doesnot hurtan lgcthis performance, and it mayheip significant Y conect ‘Yes Acordngto the trends ite gure above ig networks usualy perform beter tan sal networs (2 creasng tne traning set se generaycoes nt hurt an algorits erformance nat may help inion, Y Correct Yer: Bringing more dta toa madelis most ays bene 1D decreasing the se ofa ners network generally does not hurt nalgoithm’ performance anditmay help sigan 1D oecreseing tne wang satin ner ose net hurt a lgrtnns prtoxmans, nl shee rican.