Documentation

LeanPool.PLAcceleratedNesterovLean.MainTheorem

Public main theorem wrappers #

Local Polyak-Łojasiewicz condition syntax for the public theorem statements.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    manifold typeclass syntax for the public theorem statements.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      smooth embedding syntax for the public theorem statements.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem PLAcceleratedNesterovLean.nesterov_pl_accelerated_rate {d : } (L μ : NNReal) :
        ∃ (ρ : ), ∀ (f : EuclideanSpace (Fin d)) (k : ) (M : Type u_1) [inst : TopologicalSpace M] [inst_1 : ChartedSpace (EuclideanSpace (Fin k)) M] [IsManifold (modelWithCornersSelf (EuclideanSpace (Fin k))) 2 M] [Nonempty M] (ι : MEuclideanSpace (Fin d)), Manifold.IsSmoothEmbedding (modelWithCornersSelf (EuclideanSpace (Fin k))) (modelWithCornersSelf (EuclideanSpace (Fin d))) 2 ιSet.range ι = argminSet f∀ (U : Set (EuclideanSpace (Fin d))), IsOpen USet.range ι UContDiffOn 2 f U(0 < μ DifferentiableOn f U xU, gradient f x ^ 2 2 * μ * (f x - fStar f)) → LipschitzOnWith L (gradient f) U∃ (Ū : Set (EuclideanSpace (Fin d))), IsOpen Ū Set.range ι Ū Ū U x₀Ū, ∀ (t : ), (nesterovSeqGen f (1 / L) ρ { x := x₀, v := 0 } t).x U (nesterovSeqGen f (1 / L) ρ { x := x₀, v := 0 } t).lookahead (1 / L) U f (nesterovSeqGen f (1 / L) ρ { x := x₀, v := 0 } t).x - fStar f 2 * Real.exp (-(t / (L / μ))) * (f x₀ - fStar f)

        Embedded-manifold main theorem.

        Assume the minimizer set of f is the range of a nonempty embedded k-manifold, U is an open neighborhood of this manifold, f is on U, satisfies the local μ-PL inequality on U, and has L-Lipschitz gradient on U. A tubular sub-neighborhood is constructed internally. Then there exists a momentum parameter ρ, depending only on L and μ, such that all sufficiently local starts converge with the explicit accelerated prefactor-two bound.

        theorem PLAcceleratedNesterovLean.nesterov_pl_accelerated_rate_c3 {d : } (L μ : NNReal) :
        ∃ (ρ : ), ∀ (f : EuclideanSpace (Fin d)) (U : Set (EuclideanSpace (Fin d))), IsOpen UargminSet f UContDiffOn 3 f U(0 < μ DifferentiableOn f U xU, gradient f x ^ 2 2 * μ * (f x - fStar f)) → LipschitzOnWith L (gradient f) U∃ (Ū : Set (EuclideanSpace (Fin d))), IsOpen Ū argminSet f Ū Ū U x₀Ū, ∀ (t : ), (nesterovSeqGen f (1 / L) ρ { x := x₀, v := 0 } t).x U (nesterovSeqGen f (1 / L) ρ { x := x₀, v := 0 } t).lookahead (1 / L) U f (nesterovSeqGen f (1 / L) ρ { x := x₀, v := 0 } t).x - fStar f 2 * Real.exp (-(t / (L / μ))) * (f x₀ - fStar f)

        C³ main theorem.

        Assume U is an open neighborhood of the global minimizer set, f is on U, satisfies the local μ-PL inequality on U, and has L-Lipschitz gradient on U. The minimizer geometry and tubular sub-neighborhood are constructed internally.