Theorem 5, p. 21 — along the high-resolution ODE of NAG-C, inf_{t₀≤u≤t}‖∇f(X(u))‖² ≤ (12 + 9sL)‖x₀ − x⋆‖²/(2√s(t³ − t₀³))
ProvedHighResODE.NAGCODE.theorem_5Let be an -smooth convex function with Lipschitz-continuous Hessian, and let be a minimizer of . Fix an arbitrary step size , put , and let solve the high-resolution ODE of NAG-C
Then the squared gradient norm satisfies
With this is an rate for the squared gradient norm, faster than the that follows from the function-value rate. It is the continuous-time counterpart of the inverse cubic rate of NAG-C (Theorem 6 of the paper), and it is driven by the Hessian (gradient-correction) term, which the low-resolution ODE lacks.
Formalization Note The statement holds for every solution of the ODE on ; existence and uniqueness of the solution (Proposition 2.2 of the paper) are not assumed. The minimizer is assumed to exist, as the paper presupposes. The infimum is over the points of . The step size is unrestricted: there is no condition .
import Mathlib import Definitions.Def_HighResODE_NAGCODE_Setting
namespace HighResODE.NAGCODE
open scoped InnerProductSpace
/-- Theorem 5, p. 21: for `f ∈ F²_L(ℝⁿ)`, any step size `s > 0` and the solution `X` of (1.12),
`inf_{t₀≤u≤t} ‖∇f(X(u))‖² ≤ (12 + 9sL)‖x₀ − x⋆‖²/(2√s(t³ − t₀³))` for all `t > t₀ = 1.5√s`. -/
theorem theorem_5 {n : ℕ} (f : HighResODE.NAGSC.E n → ℝ) (L s : ℝ) (hf : IsF2 f L) (xs : HighResODE.NAGSC.E n)
(hmin : ∀ z : HighResODE.NAGSC.E n, f xs ≤ f z) (hs : 0 < s) (x0 : HighResODE.NAGSC.E n) (X V : ℝ → HighResODE.NAGSC.E n)
(hsol : IsNAGCODE f s x0 X V) :
∀ t : ℝ, t0 s < t →
(⨅ u : Set.Icc (t0 s) t, ‖gradient f (X u)‖ ^ 2)
≤ (12 + 9 * s * L) * ‖x0 - xs‖ ^ 2 / (2 * Real.sqrt s * (t ^ 3 - (t0 s) ^ 3)) := by sorry
end HighResODE.NAGCODE
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.