What does gradient descent do?
- Solves for the best parameters with one formula
- Steps against the slope many times
- Guesses at random until it gets lucky
The slope is still steep, yet each step barely moves. What is wrong?
- The step size is too small
- The slope is too gentle to push the walk along
- The error has no minimum
Error w squared, w is 5. With step size 0.2 the first step lands at 3. Make the step size ten times larger, 2, and give where the first step lands.
Answer: ______________
The stopping rule ends the walk when the slope is nearly zero. What kind of spot can that be?
- Only the lowest point of the whole error surface, every single time, whatever the starting point
- Any nearly flat spot: usually a local minimum, but a flat top or a gentle slope counts too
- Only a local minimum, never a flat top or a gentle slope
The steps swing wider each round and the error grows. What happened?
- The size is far too large, so the search diverges
- The valley is far too smooth, so no size can work
- The start was far too good
Error w squared, w is 5, step size 0.2. Give w after three steps.
Answer: ______________
Two runs from different starts can end at different minima.
Circle one: True False
A run explodes, and halving the size still explodes. What should you try next?
- Double the size back up
- Freeze all parameters forever and stop searching
- Keep shrinking the size until it descends