- 9
- 77 487
ML Tech Track
Canada
Приєднався 31 жов 2020
***************************************************************
UPDATE (September 2021):
The channel name was changed to "ML Tech Track" (before was "Ai Jedi") to reflect the purpose of this channel better.
Due to workloads I cannot make new videos every week. I'll start posting new contents starting 2022. The content includes Distributed System Design, Machine Learning System Design, and Coding. Stay tuned :)
***************************************************************
Welcome to my channel :)
Here I talk about materials you need to become an amazing Machine Learning Engineer. The topics I cover in this channel include:
- Coding interview practice (mostly Medium and Hard problems) and coding patterns you need to know in order to solve many unseen problems
- Distributed System Design
- Machine Learning System Design
This channel is new and your support encourages me to post more frequently.
Enjoy the posts :)
Topological Sort - Course Schedule II
Leetcode coding problem 210 (Medium): Course Schedule II
Step by step problem solving Topological Sort Coding Pattern.
// MY RECOMMENDATIONS:
Great "Machine Learning" Book:
📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE
Great "System Design" Book:
📚 Designing Data-Intensive Applications: amzn.to/3n05KYW
#topologicalsort #codingpatterns #coding #interview #algorithm #python
Step by step problem solving Topological Sort Coding Pattern.
// MY RECOMMENDATIONS:
Great "Machine Learning" Book:
📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE
Great "System Design" Book:
📚 Designing Data-Intensive Applications: amzn.to/3n05KYW
#topologicalsort #codingpatterns #coding #interview #algorithm #python
Переглядів: 307
Відео
Merge K Sorted Lists (K-Way Merge Coding Pattern)
Переглядів 1,1 тис.3 роки тому
Leetcode coding problem 23 (Hard): Merge K Sorted Lists. Step by step problem solving using K-Way Merge Coding Pattern. // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE Great "System Design" Book: 📚 Designing Data-Intensive Applications: amzn.to/3n05KYW #codingpatterns #coding #interview #algorithm #pytho...
3 HOUR STUDY WITH ME | 10 min break | Jazz music |
Переглядів 3853 роки тому
In this video I am working studying at the same time. My script needs to process a huge data set and I cannot do much during this time except studying. This video has 3 x 45 min with 10 min break in between (Pomodoro technique). Hope this session can motivate you to get you things done :) // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras,...
Machine Learning System Design (YouTube Recommendation System)
Переглядів 61 тис.3 роки тому
As an excellent Machine Learning System Design example, I am going through the following paper: "Recommending What Video to Watch Next: A Multitask Ranking System" by Google Inc. presented at RecSys 2019. [PDF] daiwk.github.io/assets/youtube-multitask.pdf // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE G...
Linked List Cycle II (Fast and Slow Pointers Coding Pattern)
Переглядів 5 тис.3 роки тому
Leetcode coding problem 142 (Medium): Given a linked list, return the node where the cycle begins. If there is no cycle, return null. In this video I show how to use "Fast & Slow pointers" (aka Hare & Tortoise) technique to solve coding problems. // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE Great "Sys...
Longest Substring With At Most K Distinct Characters (Sliding Window Coding Pattern)
Переглядів 8 тис.3 роки тому
Leetcode coding problem 340 (Hard): Longest Substring with At Most K Distinct Characters. In this video I show how to solve similar problems using "Sliding Window" technique. // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE Great "System Design" Book: 📚 Designing Data-Intensive Applications: amzn.to/3n05K...
Sudoku Solver (Backtracking)
Переглядів 4923 роки тому
Leetcode coding problem 37 (Hard): Write a program to solve a Sudoku puzzle by filling the empty cells. Step by step problem solving using backtracking. // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE Great "System Design" Book: 📚 Designing Data-Intensive Applications: amzn.to/3n05KYW #codingpatterns #co...
3 HOUR WORK/STUDY WITH ME | 10 min break | Light music and Background noise
Переглядів 2443 роки тому
If you have some works that need to be done and you don't mind a light music and background noise, come and join me. This video has 3 x 45 min with 10 min break in between (Pomodoro technique). Have a productive session :) // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to/3pwbjjE Great "System Design" Book: 📚 Desi...
1 HOUR WORK/STUDY WITH ME | 10 min break | Light music and Background noise
Переглядів 2424 роки тому
Code with me or work with me is a variation of "study with me" but for coders or anybody who don't mind to listen to music while working :) It has been shown that listening to music while programming often increases focus and productivity. Happy coding / working :) // MY RECOMMENDATIONS: Great "Machine Learning" Book: 📚 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow: amzn.to...
Incredibly useful!
Now, let's do it iteratively :)
Thank you for this video. Love the content and explanation. Just one comment on the recording itself. I don't know what it is but i see a lot of videos with this effect where the video cuts like every two seconds. my brain hurts when it happens so many times.
do you have any ML book recommendations using pytorch?
Great video!! How are the initial 1M videos selected? is it based on category, etc and newness & trending factor? Whenever a user clicks on a video, we see recommendations in just a second. I don't think it's practically possible to select 1M videos for each video clicked by user and then do all the analysis in real-time. Is it possible that for each video when uploaded, it already identifies and stores ids & metadata of the possibly going-to-be recommended 500 videos? Whenever a user selects a video, it joins his attributes & past videos with this 500 videos quickly?
Your calculation of queries per second is incorrect. There are 2 billion monthly active users, each user watches X videos per month. If you divide 2X by the number of seconds in a month, you will get the average QPS.
brilliant
Could anyone here help me out with similar ML System Design problems that Google/ Meta might ask in their interviews?
For someone not yet deep into ML, it's pretty good info as well.
I loved your way of way of teaching. Would be great to see more paper review like this
Wow 👏
Wow Amazing Thank you!!!!
Thank you! I thought it mean at most K of a single character xD
What do you study bro?
Thank you. After seeing your lecture I just solved LeetCode "141. Linked List Cycle" problem by only one submission. Awesome.
@ML Tech Track how do u modify this code to return the substring with the same condition.
The scaling/load calculation looks wrong at many levels! 700 users watching youtube or being recommended next video at any given second? Grossly incorrect number
I think the specific problem here is that it’s not valid to take the MAU and divide it in that way. It’s probably true that mostof youtube‘s monthly active users are also for example, daily active users. thanks for the video nevertheless!
It is interesting and very helpful!! Please do post more such ML paper reviews..glad i came across your vid. Clear and detailed explanation 👏👍
scholar score = scalar score
🤜🏼🤛🏼 nice work
ngl, the mathematical proof (or intuition behind it) is the most important part of a problem like this. Leaving it out doesn't make any sense. Intuitively, if the cycle started at the head, moving forward the length of the cycle would bring you back to the start of the cycle. If the cycle starts at head.next, moving forward the length of the cycle would bring you one step away from the start the of cycle. If the cycle starts at head(.next k times), moving forward the length of the cycle would bring you k steps away from the start of the cycle.
I do not get the part where you saying the line 30 to 33
Clear like water bro!
very good video .. impressive
I would like my time back
Well explained. Thank you for the video
How much u charge for making a video recommendation system for Android app?
The improvement is not significant at all.
so helpful, i really like how you did that pseudocode while explaining the pattern!
Best explanation I have seen in ML system area! Thanks!
Great overview. Thanks!
why second approach time com is 9!^9 not 9!*9 ?
Clear, simple, direct illustration 👌 Thanks
Could you explain how the logistic regression or the random forest would narrow down the list of candidates in the funnel?
Hi @Daniel, generally speaking, random forest and logistic regression are much lighter/simpler models compared to Deep Nets. We can use these simple model to filter a very large candidates (100s of millions of candidate for recommendations). Note that they don't need to be precise. The goal at this stage is to get rid of tons of not-relevant candidates and narrow down our candidates from 100s of millions to few hundreds or thousands. Then we can apply more complex models (e.g. Deep net) to search among them and choose the right ones with high precision.
@@MLTechTrack Is the shallow candidate generation model just for reducing latency ?
Small Improvements: cycle_len += 1 for each iteration of the original while loop, so you immediately know the meeting point once we have broken out of the while loop and determined cycle_len != -1: slow = head (fast already equals the original meting node) <perform the next for loop, looking for when they meet> This will save you two unnecessary for-loops! Otherwise great explanation :)
Hmm ok so algorithms with scaling runtimes in order to operate on large to small amounts of data, makes sense. Does anyone know how that first "simply query" would go from billions of videos to one million?
Nice job. Thanks.
thank you, it is so usefull!
Woah... Neat explanation... thankyou
trying to find the dataset and code .. hihi
Thank you for the clear and concise explanation! It would be great if you continued such videos for ML Design Interview prep on other topics! Looking forward to it!
Thanks Alisa! I've been swamped by work in the past few months. I'l try resume ML system design and Distributed System Design in 2-3-3 months. Thanks for the encouragement! :)
Me too
Thanks!🙏🏾
Very useful video. Thanks!
So 2 bio people watching 1 sec per month, huh??
Could you also do scaling analysis - like how this model would scale and deploy this model to be able to serve potentially >700 requests/sec? Thanks for the amazing content!
Thanks Shivam for the great suggestions! I am going to prepare some videos on scaling such systems and distributed system design in general. Stay tuned 😀
Nice overview. Thanks!
Thanks @Intellimath! Glad that it was helpful😀
Hi 👋; Glad to hear you . I have to learn basic forms of your course. I try to learn with you .
😘👍