← All setups

Composite Generalized Accelerated — Composite Generalized Smooth Minimization

Descriptions may be stale. Consult the linked Lean sources.

Composite Generalized Smooth Minimization · Lean proof

Composite Generalized Smooth Minimization

We consider minimizing F=f+ψ over a convex set Q in a real Hilbert space E, where f,ψ:E→R. The function f is convex and continuously differentiable, ψ is convex on Q, and f is (L0,L1)-smooth with L0>0 and L1≥0. A given point x0∈Q has bounded distance and objective gap to a minimizer x⋆, whose gradient norm is bounded. The oracle returns ∇f(x) at x and exact constrained proximal minimizers. For ε>0, the goal is x¯∈Q with F(x¯)−F(x⋆)≤ε almost surely under P, the law of the algorithm’s randomness.

The optimization problem is minx∈QF(x),F(x):=f(x)+ψ(x). The norm ∥⋅∥ is induced by the inner product ⟨⋅,⋅⟩ on E. The parameters satisfy L0>0,L1≥0,R>0,Δ>0,G≥0,ε>0. The algorithm receives only E,L0,L1,R,Δ, and x0; G and ε may enter the oracle-call budget but are not algorithm inputs.

Our assumptions:

Assumption 1 (Convexity). The set Q⊆E is convex. For every t∈[0,1], f((1−t)x+ty)≤(1−t)f(x)+tf(y)for x,y∈E,ψ((1−t)x+ty)≤(1−t)ψ(x)+tψ(y)for x,y∈Q.

Assumption 2 (Generalized smoothness). The function f is Fréchet differentiable everywhere on E, and ∇f:E→E is continuous. For every x,y∈E and M∈R, the implication ∥∇f(x+θ(y−x))∥≤Mfor every θ∈[0,1]⟹∥∇f(x)−∇f(y)∥≤(L0+L1M)∥x−y∥ holds.

Assumption 3 (Exact proximal access). There is a map T:R×E×E→E such that, for every a>0 and z,v∈E, T(a,z,v)∈argminu∈Q{∥u−z∥22a+⟨v,u−z⟩+ψ(u)}.

Assumption 4 (Initialization and minimizer bounds). The given starting point satisfies x0∈Q. There exists x⋆∈Q such that F(x⋆)≤F(x)for every x∈Q,∥x0−x⋆∥≤R,F(x0)−F(x⋆)≤Δ,∥∇f(x⋆)∥≤G.

The oracle returns ∇f(x) at x. It also accepts a proximal query (a,z,v)∈R×E×E and returns T(a,z,v); the minimization property is required for a>0. Gradient queries may be made at any x∈E. Gradient and proximal queries each count as one call toward a shared oracle-call budget.

After the allotted calls, the output must satisfy x¯∈Q,F(x¯)−F(x⋆)≤εP-a.s.

Proved result

3⋅⌈10⋅(L0+L1⋅G)⋅R2ε+(6+128⋅L1⋅R)⋅log⁡(2+(3+96⋅L1⋅R)⋅ΔL0⋅R2)⌉+

OracleTemplate.Convergence LongTails.Setups.CompositeGeneralizedSmooth.spec OracleTemplate.CompositeGeneralized.budget

Relevant previous results

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