Bounding how far the adapted model moves
ProofIntermediate⏱ 30 minFine-Tuninglipschitzdeviationweight decay
Problem
- Prove and state when it is tight.
- Show that weight decay with coefficient on both factors bounds in terms of the achieved training objective.
- Explain why this does not bound the change in the network's output.
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 |
|---|---|---|---|---|---|
| Lipschitz constants depend on the norm | Foundations | Numerical | 15 min | ||
| The supremum is 1-Lipschitz in the uniform norm | Foundations | Proof | 15 min | ||
| Why AdamW differs from Adam with L2 | SGD | Proof | 30 min | ||
| Derive the EWC objective | Fine-Tuning | Proof | 1 hour | ||
| Normalisation makes weights scale-invariant | Deep Learning | Proof | 30 min |