Let L be convex and L-smooth (its gradient is Lipschitz with constant L: ∥∇L(x)−∇L(y)∥≤L∥x−y∥), and let θ⋆ minimize L. Gradient descent with step size η=1/L satisfies L(θK)−L(θ⋆)≤2KL∥θ0−θ⋆∥2 after K steps.
Why is it true?
Smoothness guarantees each gradient step decreases L by an amount proportional to the squared gradient size, so L(θk) never goes up. Convexity lets us compare that per-step decrease to the still-remaining gap L(θk)−L(θ⋆). Adding up the guaranteed decreases over K steps — a telescoping sum — shows the total decrease is bounded, and since the best point in a non-increasing sequence is at least as good as the average, the final gap must shrink like 1/K.
Proof sketch
By L-smoothness, for any x,y: L(y)≤L(x)+∇L(x)⊤(y−x)+2L∥y−x∥2. Setting y=θk+1=θk−L1∇L(θk) and x=θk gives the descent lemma: L(θk+1)≤L(θk)−2L1∥∇L(θk)∥2.
By convexity of L: L(θk)≤L(θ⋆)+∇L(θk)⊤(θk−θ⋆). Adding this to the descent lemma: L(θk+1)−L(θ⋆)≤∇L(θk)⊤(θk−θ⋆)−2L1∥∇L(θk)∥2.
Complete the square on the right-hand side: ∇L(θk)⊤(θk−θ⋆)−2L1∥∇L(θk)∥2=2L(∥θk−θ⋆∥2−θk−θ⋆−L1∇L(θk)2)=2L(∥θk−θ⋆∥2−∥θk+1−θ⋆∥2), since θk+1−θ⋆=θk−θ⋆−L1∇L(θk).
So L(θk+1)−L(θ⋆)≤2L(∥θk−θ⋆∥2−∥θk+1−θ⋆∥2). Summing this for k=0,…,K−1, the right-hand side telescopes to 2L(∥θ0−θ⋆∥2−∥θK−θ⋆∥2)≤2L∥θ0−θ⋆∥2.
The descent lemma also shows L(θk) is non-increasing, so L(θK) is at most the average of L(θ1),…,L(θK): L(θK)−L(θ⋆)≤K1∑k=1K(L(θk)−L(θ⋆))≤2KL∥θ0−θ⋆∥2, which is exactly the claimed bound.