Noise, Schedules, and Adaptive Methods
Stochastic gradient descent with a fixed step does not converge - it settles into a ball whose radius grows as √η. Decaying the step removes the floor; Adam rescales each coordinate; and on a long enough run the fastest method is the one that finishes last.
IntermediateModule 325 min · 100 XP
This is a premium lesson
Sign in and enrol to read the full lesson, run the code, take the quiz, and earn XP toward the path badge.