Non-convex gradient descent reaches an approximate stationary point
ProofIntermediate⏱ 30 minOptimizationnon-convexstationary pointrate
Problem
Let be -smooth and bounded below by . Prove that gradient descent with satisfies
Then state three things this does not establish, with a concrete example for one of them.
Write a complete argument. Every inequality you use should be one you could state precisely.
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| The exact step-size threshold on a quadratic | Optimization | Proof | 15 min | ||
| Linear convergence under strong convexity | Optimization | Proof | 30 min | ||
| Measure the covariance estimation rate run | High-Dim Statistics | Coding | 1 hour | ||
| SGD on convex Lipschitz objectives | SGD | Proof | 30 min | ||
| Why exactly one factor starts at zero | Fine-Tuning | Proof | 30 min |