← All setups

Stochastic Generalized Mirror Accelerated — Stochastic Generalized Smooth Composite Minimization

Descriptions may be stale. Consult the linked Lean sources.

Stochastic Generalized Smooth Composite Minimization · Lean proof

Stochastic Generalized Smooth Composite Minimization

We consider minimizing F=f+ψ over a convex set Q in a finite-dimensional real normed space E. The function f:E→R is convex and (L0,L1)-smooth, with L0>0 and L1≥0, and ψ:E→R is convex on Q. A given starting point has bounded objective gap and Bregman divergence to a minimizer x⋆∈Q. The oracle returns unbiased stochastic derivatives with independent samples and bounded αth error moments, 1<α≤2, or exact Bregman proximal points. For ε>0 and δ∈(0,1), the goal is a measurable output x¯ satisfying x¯∈Q and F(x¯)−F(x⋆)≤ε with probability at least 1−δ.

The optimization problem is minx∈QF(x),F(x)=f(x)+ψ(x). Write E∗ for the continuous dual of E, equipped with its induced operator norm ∥⋅∥op. Let Ω be the measurable sample space. The algorithm receives E, Ω, the starting point x0, and the parameters L0>0,L1≥0,R>0,Δ>0,G≥0,σ≥0,1<α≤2,ε>0,0<δ<1. The instance supplies the objective and proximal geometry through the oracle described below.

Our assumptions:

Assumption 1 (Convexity and generalized smoothness). The function f is convex and Fréchet differentiable on E, with continuous derivative df:E→E∗. For every x,y∈E and M∈R, ∥df(x+θ(y−x))∥op≤Mfor all θ∈[0,1]⟹∥df(x)−df(y)∥op≤(L0+L1M)∥x−y∥. The set Q⊆E is convex and Borel measurable. The function ψ is measurable on E and convex on Q.

Assumption 2 (Bregman geometry and exact proximal access). There is an open convex set U⊆E and a function h:E→R that is Fréchet differentiable on U. For z∈U and u∈E, define Dh(u,z)=h(u)−h(z)−dh(z)[u−z]. The divergence satisfies Dh(u,z)≥12∥u−z∥2,z∈Q∩U,u∈Q. An exact proximal map T:R×E×E∗→E is supplied. For every a>0, z∈Q∩U, and v∈E∗, T(a,z,v)∈Q∩U,T(a,z,v)∈argminu∈Q{a(v[u−z]+ψ(u))+Dh(u,z)}. The map on R×E×E∗ given by (a,z,v)⟼{T(a,z,v),a>0,x0,a≤0 is measurable.

Assumption 3 (Initial bounds and a minimizer). The given point satisfies x0∈Q∩U. There exists x⋆∈Q such that F(x⋆)≤F(x)for every x∈Q,Dh(x⋆,x0)≤R2/2,F(x0)−F(x⋆)≤Δ,∥df(x⋆)∥op≤G.

Assumption 4 (Stochastic derivative oracle). There is a probability measure μ on Ω and a jointly measurable map g:E×Ω→E∗. For every x∈Q, the map g(x,⋅) is Bochner integrable, the random variable ∥g(x,ξ)−df(x)∥opα is integrable for ξ∼μ, and Eξ∼μ[g(x,ξ)]=df(x),Eξ∼μ[∥g(x,ξ)−df(x)∥opα]≤σα. The sample sequence (ξk)k≥0 has a joint probability law ν on ΩN under which its coordinates are measurable, mutually independent, and each distributed according to μ. This sequence is independent of the algorithm’s randomness. At call k, a derivative query at x∈E returns g(x,ξk); a proximal query (a,z,v)∈R×E×E∗ returns T(a,z,v).

Both types of query count toward the same total oracle-call budget. The output x¯∈E must be measurable and satisfy P(x¯∉Q or F(x¯)−F(x⋆)>ε)≤δ, where P is the joint law of the algorithm’s randomness and the sample sequence.

Proved result

⌈8589934592⋅(1+(1+L1⋅R)⋅log⁡(8+8⋅Δε)+(L0+L1⋅G)⋅R2ε+2561α−1⋅(σ⋅Rε)αα−1)⋅(log⁡(8589934592⋅(1+(1+L1⋅R)⋅log⁡(8+8⋅Δε)+(L0+L1⋅G)⋅R2ε+2561α−1⋅(σ⋅Rε)αα−1)δ))2⌉+

OracleTemplate.Convergence LongTails.Setups.StochasticGeneralizedMirror.spec
  LongTails.Theorems.StochasticGeneralizedMirrorAccelerated.budget

Relevant previous results

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