Interviews
全連接跟卷積差別在哪?為什麼CV用卷積居多? 優勢是什麼?
捕捉空間特徵?參數可複用減少運算 另外也可捕捉重複特徵?
激勵函數引入非線性的目的是什麼?如果只有線性會怎樣?
實際問題很多情況都非線性,不是能靠線性函數解決 *可以補充sigmoid, tanh, relu, softmax…各自帶來的優點
without activation function
Self supervised learning, GAN, Model compression, Model compression, Knowledge distillation, Image classification, object detection, Super resolution這幾個去分類 你會分幾類?怎麼分?
你處理過最難的bug是什麼?
碩班期間,老闆給你的彈性如何?方向跟方法多少是自己決定的?
有沒有老闆覺得目標或方法可行,但你覺得不可行的時候,怎麼處理和最後結果如何?
做過的專案中的這些模型你是直接使用,還是有做什麼調整嗎?
請簡介一個深度學習模型專案流程,並說明如何評估表現?如果表現不夠好,最可能出問題的地方在哪?應該如何調整?
CV相關的議題可以舉出哪些?如果有機會錄取,最想做哪一個?
測驗環境(網站)是Coderbyte
Key:
a. reverse string : swap記得call by reference, size要size-i-1因為string最後一個位置是'\0'
b. binary有可能超過int大小 所以用long long
c. stoi跟to_string要熟悉
Test cases:
"47" ->101111-> 00101111->11110100->244
"213" -> 171
"4567" -> 60296
"12" -> 1100 -> 00001100 -> 00110000 -> 48
Have the function LRUCache(strArr) take the array of characters stored in strArr, which will contain characters ranging from A to Z in some arbitrary order, and determine what elements still remain in a virtual cache that can hold up to 5 elements with an LRU cache algorithm implemented. For example: if strArr is ["A", "B", "C", "D", "A", "E", "D", "Z"], then the following steps are taken:
(1) A does not exist in the cache, so access it and store it in the cache.
(2) B does not exist in the cache, so access it and store it in the cache as well. So far the cache contains: ["A", "B"].
(3) Same goes for C, so the cache is now: ["A", "B", "C"].
(4) Same goes for D, so the cache is now: ["A", "B", "C", "D"].
(5) Now A is accessed again, but it exists in the cache already so it is brought to the front: ["B", "C", "D", "A"].
(6) E does not exist in the cache, so access it and store it in the cache: ["B", "C", "D", "A", "E"].
(7) D is accessed again so it is brought to the front: ["B", "C", "A", "E", "D"].
(8) Z does not exist in the cache so add it to the front and remove the least recently used element: ["C", "A", "E", "D", "Z"].
Now the caching steps have been completed and your program should return the order of the cache with the elements joined into a string, separated by a hyphen. Therefore, for the example above your program should return C-A-E-D-Z.
leetcode : https://leetcode.com/problems/lru-cache/
string to array
atoi & stoi
char to const char to string…
queue iteration