【新提醒】上岸撒花and在职跳槽时间线【一亩三分地求职版】 -



【新提醒】上岸撒花and在职跳槽时间线【一亩三分地求职版】 -

18年6月仓促中入职湾区某养老院,进去才发现里面的developer都是40+yr,relaxed,no ambition,mediocore and everyone is happily lowballed. 第一天就决定跳槽。

18年12月面狗家,再次被fail,决心认真刷题

19年1月16号L家recruiter intro call. 申请ML/Data miniing track

19年2月20号电面,经典unfair coin sampling+ML基础问题。

19年2月26号postive feedback, move forward to oniste.. check 1point3acres for more.

19年4月3号onsite,6 rounds:
1.Host manager round:Previous ML projects+BQ. 上天眷顾,楼主刚好有一篇nature communication的ML paper三天前accepted,拿来刚好用来impress host manager. 后来事实证明,host manager这一轮是所有面试中最最最重要的一轮。因为之前没有任何在大厂工作的经验,加上当时的公司非常偏silicon,所以HC在review的时候有非常多的concern(尽管所有6轮面试都基本上很顺利的crack了)。最后Host manager最后strongly vouch for楼主, 得以最终顺利过关。

2.Coding轮,一道string replacement,一道max stack。一位香港大哥,一位同学校的学弟shadow。没记错的话我应该还TA过他....

3.吃饭。白人小哥和同学校学弟again.....闲聊扯淡顺利结束。. check 1point3acres for more.

4.Data coding. 法国小哥, MIT PhD at Pure math,各种概率统计问题, 时间有点久我已经忘了具体问了什么了,反正就是各种推导证明,完全无coding

5. ML System Design, 国人姐姐加国人小哥shadow。基本就是google wide+deep model的推荐系统

6. Data mining. 香港小哥,Bayesian Optimization, Bayesian Inference, Gaussian Process Regression, SVM, Generalized Linear Model, exponential family,  Logistic Regression, Tree model and emsembles. CNN, RNN, DNN. How to tune each of them, regularization, why it works, lagrange multiplier,  etc.....非常杂非常多。建议面ML的小伙伴,一定要把所有常见的model全部都手推一遍。特别是有probabilistic interpretation的,一定要知道是如何推导的。

所有面试的提问环节,最好根据每位面试官的team不同,提出不同的specific的问题。听起来很难,但是实际上稍微跟一跟这些大厂在KDD,NIPS,ICML这几年的pape, talk以及linkedin的engineering blog仔细翻一遍,想几个比较relevant的问题,就很容易impress面试官。比如MIT小哥做optimization, 刚好KDD18 linkedin有一篇multi-objective optimization的paper用gaussian process regression的,针对自己没看明白的几个部分随便问问,小哥开心的不得了。host manager做search的,KDD16/17 Linkedin做了deep personalized search的tutorial然后host manager之前也有search quality的talk,看一遍把主要idea和问题熟记在心,交流起来顺畅无比。总结下来就是要真的跟一跟ML这个领域最新的progress才真的能应付的得心应手。

19年4月15号过HC开始team match

19年4月19号match到三个team

19年4月23号三轮team matching chat-baidu 1point3acres

Read full article from 【新提醒】上岸撒花and在职跳槽时间线【一亩三分地求职版】 -


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts