thank you for the lecture, if you train with the first sample, the calculated answer will be closer to the real answer of the first data, after that you train with the second sample, how can you guarantee that the when you input the first sample again, the error won't be larger?
P is the point of interest (I use 0.5, works fine)
This creates 1.0 if it matches the point and grows outward from the point in BOTH directions reaching 0 at the same distance from the point, the speed of the drop is determined by the tightness. Easier to calculate, and the error function is easily streamlined along with the feedfowarding.
This has been flagged as spam show
The best back propagation info/video i've found. Awesome!
Rhembot 1 month ago
Comment removed
Rhembot 1 month ago
Comment removed
Rhembot 1 month ago
Test coming tomorrow. This helps, thanks!
trisky1234 2 months ago
im only 9 mins in so far but already THANK YOU! :)
rflood89 3 months ago
Love the moustache my friend. LOVE IT.
hxmstu 3 months ago
Excellent explanation, thank you very much!!!!!
National University Federico Villarreal
Computer engineering student
Lima, Peru
ZERL1NG 4 months ago
I have a back propagation neural network, its my favorite NN.
daviddalbylive 11 months ago
Slightly off-topic, but I love that intro. Anyone knows the artist?
hmjkg 1 year ago
@hmjkg me too
fsl4faisal 1 month ago
i realy like this videos
i am fan of prof.p.dasgupta
manuGori7 1 year ago
thank you for the lecture, if you train with the first sample, the calculated answer will be closer to the real answer of the first data, after that you train with the second sample, how can you guarantee that the when you input the first sample again, the error won't be larger?
genghiskii 1 year ago
@genghiskii This is because you calculate the change of the whole error E by changing the weight Wi,j - not just the vector component error Err.
AndreasBacher85 1 year ago
wow nice handwriting
25380421859 1 year ago 4
@25380421859
I think the same
selotmani1 1 year ago
excellent work!
1888junkteam 2 years ago 6
I personally use my own algorithm:
=max(1-(T(P-x))^2,0)
T is the tightness (0.1 to start and increment)
P is the point of interest (I use 0.5, works fine)
This creates 1.0 if it matches the point and grows outward from the point in BOTH directions reaching 0 at the same distance from the point, the speed of the drop is determined by the tightness. Easier to calculate, and the error function is easily streamlined along with the feedfowarding.
sabriath 2 years ago
Another question:
Should I correct the value of the bias as well ?
1shiOne 2 years ago
what is the difference betwee activation function and transfert function.
MsBernis 2 years ago
I youst making kandi this tuf
thisgonabeegreat 2 years ago
Comment removed
thisgonabeegreat 2 years ago
Nice lecture !
But I have a question. At 34:00 he is using g'(x) instead of g(x). What is g' ? g was the activation function (sigmoid).
1shiOne 2 years ago
Comment removed
KirusRaysor 2 years ago
g'(x) is the derivative of g(x)
If g(x) is choosen to be the sigmoid, then g'(x) would be:
g'(x)=g(x)*(1-g(x))
KirusRaysor 2 years ago 7
Comment removed
1shiOne 2 years ago
Gradient of the sigmoid?
OriginalAtomicSheep 2 years ago
yes, to find the direction to reach a minimum
feebdaed 2 years ago
Great Lecture.
sajinkoroth 2 years ago
interesting
berjberj1 2 years ago
Thank you , this lecture it was helpfull!!
viviom 2 years ago 2
great !
vangtid 2 years ago
Very good, thank you, you talk slow and clear. thank you...
rg071970 2 years ago
it will be better if figures ar pre-drawn and more stress should be given on explanaton.
rohit85727 2 years ago
Fantastic lecture. You really have the gift of teaching in an understandable way.
rakimo 3 years ago
so nice...
tweety504 3 years ago
lovely...
aan1923 3 years ago