SGD on convex Lipschitz objectives
ProofIntermediate⏱ 30 minSGDsgdconvexaveragingrate
Problem
Prove for SGD with constant step , where and . Note where the proof is identical to the deterministic subgradient argument and where it differs.
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 |
|---|---|---|---|---|---|
| Measure the covariance estimation rate run | High-Dim Statistics | Coding | 1 hour | ||
| Mini-batching and the compute budget | SGD | Numerical | 30 min | ||
| Non-convex gradient descent reaches an approximate stationary point | Optimization | Proof | 30 min | ||
| Reading the Robbins–Monro conditions off the proof | SGD | Proof | 30 min | ||
| Expected error does not give a high-probability guarantee | SGD | Proof | 30 min |