Theorem 3.1 (32) —
ProvedRandomGradFree.Smooth.directional_oracle_second_momentLet be a real inner product space of finite dimension , a standard Gaussian vector in , and differentiable at . Let be the limiting random oracle of (30). Then
This variance bound, of order rather than the naive , is what gives the random gradient method its linear dependence on the dimension.
Formalization Note with written as fderiv ℝ f x u; no convexity is assumed, as in part 1 of the theorem.
import Mathlib open MeasureTheory ProbabilityTheory
namespace RandomGradFree.Smooth
theorem directional_oracle_second_moment {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
(f : E → ℝ) (x : E) (hfx : DifferentiableAt ℝ f x) :
∫ u, ‖fderiv ℝ f x u • u‖ ^ 2 ∂(stdGaussian E)
≤ ((Module.finrank ℝ E : ℝ) + 4) * ‖gradient f x‖ ^ 2 := by sorry
end RandomGradFree.Smooth
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting.
- is a finite-dimensional real inner product space with its Borel σ-algebra, and .
- is the standard Gaussian measure on (as defined in Mathlib).
- is any function and .
Hypothesis. is (Fréchet) differentiable at . Write for its derivative, a linear map , and for the gradient, the vector with .
Claim.
No other assumption is made on , such as convexity, smoothness elsewhere, or growth conditions.
Degenerate cases.
- Integral convention. The integral is the Lebesgue/Bochner integral. If the integrand were not integrable, the integral would be defined as and the inequality would hold trivially.
- . Both sides are .
- . The claim says the left side is at most .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.