Silver Rate Is (Almost) Optimal for Gradient Descent Acceleration
New optimization theory paper proves near-optimal lower bounds for gradient descent with predetermined stepsizes, confirming silver-schedule optimality.
1 stories, newest first · one card per story
New optimization theory paper proves near-optimal lower bounds for gradient descent with predetermined stepsizes, confirming silver-schedule optimality.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views