← All setups

Generalized Accelerated Convex — Generalized Smooth Convex Minimization

Descriptions may be stale. Consult the linked Lean sources.

Generalized Smooth Convex Minimization · Lean proof

Generalized Smooth Convex Minimization

We consider minimizing a convex function f:E→R on a real Hilbert space E. The function f is (L0,L1)-smooth, with L0>0 and L1≥0, and has an everywhere differentiable gradient. A given point x0∈E satisfies ∥x0−x⋆∥≤R and f(x0)−f(x⋆)≤Δ for a global minimizer x⋆, where R,Δ>0. The oracle returns ∇f(x) at x. For ε>0, the goal is an output x¯∈E satisfying f(x¯)−f(x⋆)≤ε almost surely under P, the law of the algorithm’s randomness.

The optimization problem is minx∈Ef(x). The norm ∥⋅∥ is induced by the inner product on E, and ∥⋅∥op denotes the induced operator norm. The algorithm receives E, L0, L1, R, Δ, and x0; the tolerance ε may enter the oracle-call budget but is not an algorithm input.

Our assumptions:

Assumption 1 (Convexity). For every x,y∈E and t∈[0,1], f((1−t)x+ty)≤(1−t)f(x)+tf(y).

Assumption 2 (Generalized smoothness). The function f is Fréchet differentiable everywhere on E, and its gradient ∇f:E→E is Fréchet differentiable everywhere. Its Hessian ∇2f(x):E→E satisfies ∥∇2f(x)∥op≤L0+L1∥∇f(x)∥,x∈E.

Assumption 3 (Minimizer and initialization). There exists x⋆∈E such that f(x⋆)≤f(x)for every x∈E,∥x0−x⋆∥≤R,f(x0)−f(x⋆)≤Δ.

Queries may be made at any point of E. After the allotted oracle calls, the output must satisfy f(x¯)−f(x⋆)≤εP-a.s.

Proved result

{0Δ≤ε2⋅⌈4096⋅(1+L0⋅R2ε+⌈(L1⋅R)23⌉+⋅log⁡(4+4⋅Δε))⌉+otherwise

OracleTemplate.Convergence LongTails.Setups.GeneralizedSmoothAndConvex.spec OracleTemplate.GeneralizedAccelerated.budget

Relevant previous results

No qualifying prior reference verified; this is not a proof of novelty.