← All setups

Full Generalized Smooth Convex Lower Bound — 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:Rd→R in dimension d∈N. The function f is (L0,L1)-smooth, meaning its differentiable gradient satisfies ∥∇2f(x)∥op≤L0+L1∥∇f(x)∥ everywhere, with L0>0 and L1≥0. A given point x0∈Rd lies within distance R>0 of a global minimizer x⋆. The oracle returns ∇f(x) at x. For a tolerance ε>0, the goal is an output x¯∈Rd with integrable objective gap and EP[f(x¯)−f(x⋆)]≤ε, where P is the law of the algorithm’s randomness.

The optimization problem is minx∈Rdf(x). We use the Euclidean norm and its induced operator norm. The parameters obey L0>0,L1≥0,R>0,0<ε≤L0R216,d≥⌈17592186044416(1+L1R+L0R2ε)5⌉. The algorithm receives d, L0, L1, x0, R, and ε.

Our assumptions:

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

Assumption 2 (Generalized smoothness). The function f is differentiable everywhere, its gradient is Fréchet differentiable everywhere, and ∥∇2f(x)∥op≤L0+L1∥∇f(x)∥,x∈Rd. Here ∇2f(x):Rd→Rd is the derivative of the gradient.

Assumption 3 (Initial distance). There exists x⋆∈Rd such that f(x⋆)≤f(x)for every x∈Rd,∥x0−x⋆∥≤R.

Queries may be made at any point of Rd. After the allotted oracle calls, the output must have an integrable objective gap under P and satisfy EP[f(x¯)−f(x⋆)]≤ε.

Proved result

⌊L0⋅R2ε+L1⋅Rlog⁡(2+L1⋅R)8388608⌋+

OracleTemplate.NonConvergence LongTails.Setups.GeneralizedSmoothConvexFull.spec
  LongTails.Theorems.FullGeneralizedSmoothConvexLowerBound.budget

Relevant previous results