The proximal operator of the l1 norm
ProofBeginner⏱ 15 minAdvanced Optimizationproximalsoft thresholdseparability
Problem
Show that is coordinatewise soft thresholding, and verify it is firmly non-expansive: .
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 |
|---|---|---|---|---|---|
| XOR is not linearly separable | Deep Learning | Proof | 15 min | ||
| Derive the soft-thresholding operator | High-Dim Statistics | Proof | 30 min | ||
| Logistic regression diverges on separable data | Classical ML | Proof | 30 min | ||
| The Frank–Wolfe duality gap certificate | Advanced Optimization | Proof | 30 min | ||
| Projection onto the probability simplex | Advanced Optimization | Proof | 1 hour |