← All setups

Strong Growth Finite Sum Acceleration — Strong Growth Finite-Sum Minimization

Descriptions may be stale. Consult the linked Lean sources.

Strong Growth Finite-Sum Minimization · Lean proof

Strong Growth Finite-Sum Minimization

We minimize F(x)=n−1∑i=1nfi(x) on a finite-dimensional real inner product space E, where n≥1 is an integer. Each component fi:E→R is convex with L-Lipschitz gradient, and F is μ-strongly convex, with L,μ>0. Strong growth requires n−1∑i=1n∥∇fi(x)∥2≤ρ∥∇F(x)∥2 for all x∈E, where ρ≥1. A given point x0∈E is within distance R≥0 of a minimizer x⋆. The oracle returns ∇fi(x) at a queried pair (i,x). For ε>0, the goal is a measurable output x¯∈E with integrable objective gap satisfying EP[F(x¯)−F(x⋆)]≤ε, where P is the law of the algorithm’s randomness.

The optimization problem is minx∈EF(x). The norm ∥⋅∥ is induced by the inner product on E, which is equipped with a measurable structure. The algorithm receives E, n, L, μ, ρ, R, ε, and x0.

Our assumptions:

Assumption 1 (Component convexity and smoothness). Each fi is Fréchet differentiable everywhere. For every i∈{1,…,n}, x,y∈E, and t∈[0,1], fi((1−t)x+ty)≤(1−t)fi(x)+tfi(y),∥∇fi(x)−∇fi(y)∥≤L∥x−y∥.

Assumption 2 (Strong convexity). For every x,y∈E and t∈[0,1], F((1−t)x+ty)≤(1−t)F(x)+tF(y)≤−μ2t(1−t)∥x−y∥2.

Assumption 3 (Strong growth). The component gradients satisfy 1n∑i=1n∥∇fi(x)∥2≤ρ∥∇F(x)∥2,x∈E, where ∇F(x)=n−1∑i=1n∇fi(x).

Assumption 4 (Initial distance). There exists x⋆∈E such that F(x⋆)≤F(x)for every x∈E,∥x0−x⋆∥≤R.

Queries may select any component index i∈{1,…,n} and any point x∈E; each reply is the exact component gradient. After the allotted oracle calls, the output x¯ must be measurable and satisfy EP[|F(x¯)−F(x⋆)|]<∞,EP[F(x¯)−F(x⋆)]≤ε.

Proved result

108⋅(min{n,⌈128⋅ρ⌉+}+⌈min{n,⌈128⋅ρ⌉+}⋅Lμ⌉+)⋅clog2(⌈7168⋅(1+Lμ)⌉+)⋅clog2(⌈L⋅R2ε⌉+)

OracleTemplate.Convergence LongTails.Setups.FiniteSumStrongGrowthStronglyConvex.spec
  LongTails.Theorems.StrongGrowthFiniteSumAcceleration.budget

Relevant previous results

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