in the slide it is n(n-1) which i think it is the true answer cuz you only remove the element you take derivative to it so remains (n-1) multiplied n times to get all n derivitives
Nice lecture! Can anyone provide some resources to read more about these materials, please? Especially, reverse mode AD by extending computational graph?
Beautifully explained!
This is the best course ever!
Great work, Tianqi!
This is the best autodiff lesson
This was amazing. Thank you so much!
Great lesson thanks!
Very nice explanation!
太棒了,拯救了我的期末大作业😭
17:07 Can someone please explain how the number of multiplication is n(n-2) ?
in the slide it is n(n-1) which i think it is the true answer cuz you only remove the element you take derivative to it so remains (n-1) multiplied n times to get all n derivitives
Yes, even I had calculated n(n-1) multiplications. But when the instructor also mentioned that it is n(n-2), I got confused. Thanks for the response.
To multiply (n-1) elements, we only need to do (n-2) multiplications 😂
@@shihaowu88 At first I also thought it was n(n-1)...it is really a brain teaser...
to multiple n variables we need do n -1 product opertations, so for n-1 variables we need n -2 operations.
Super
Nice lecture! Can anyone provide some resources to read more about these materials, please? Especially, reverse mode AD by extending computational graph?
great!
Superb
omg tysm