The AdaGrad summation inequality
ProofAdvanced⏱ 30 minSGDadagradtelescopingregret
Problem
Prove that for non-negative with ,
This is the key lemma in the AdaGrad regret analysis. Explain why it produces the form of the bound.
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 |
|---|---|---|---|---|---|
| Derive Adam's bias correction | SGD | Proof | 15 min | ||
| Why AdamW differs from Adam with L2 | SGD | Proof | 30 min | ||
| The SVRG control variate | SGD | Proof | 1 hour | ||
| Open: why does Adam beat SGD on transformers? abyss | SGD | Proof | Research |