Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 8 — under the noise condition, a plug-in policy with pointwise sub-Gaussian estimation error at rate aₙ has regret ≤ C(α,γ) B aₙ^{−(1+α)/2}

Proved
FastCLO.ETO.theorem_8

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

contextual-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1regret

Let Z={z:Az≤b}⊆Rd\mathcal Z = \{z : Az \le b\} \subseteq \mathbb R^dZ={z:Az≤b}⊆Rd be a nonempty polytope with ∥z∥≤B\|z\| \le B∥z∥≤B on Z\mathcal ZZ and extreme points Z∠\mathcal Z^\angleZ∠. Let (X,Y)(X, Y)(X,Y) have feature law PX\mathbb P_XPX​ on Rp\mathbb R^pRp and bounded costs ∥Y∥≤1\|Y\| \le 1∥Y∥≤1, with f∗(x)=E[Y∣X=x]f^*(x) = \mathbb E[Y \mid X = x]f∗(x)=E[Y∣X=x] and gap Δ\DeltaΔ. From nnn i.i.d. observations D\mathcal DD an estimate f^=f^D\hat f = \hat f_{\mathcal D}f^​=f^​D​ of f∗f^*f∗ is formed, and the estimate-then-optimize policy πf^\pi_{\hat f}πf^​​ chooses, at every xxx, an extreme point minimizing f^(x)⊤z\hat f(x)^\top zf^​(x)⊤z over Z\mathcal ZZ.

Fix α,γ≥0\alpha, \gamma \ge 0α,γ≥0 and constants C1,C2>0C_1, C_2 > 0C1​,C2​>0. There is a constant CCC, depending only on α,γ,C1,C2\alpha, \gamma, C_1, C_2α,γ,C1​,C2​, such that the following holds for every polytope, every distribution, every nnn, every an>0a_n > 0an​>0 and every estimator. If

  1. the noise condition (Assumption 2) holds: PX(0<Δ(X)≤δ)≤(γδ/B)α\mathbb P_X(0 < \Delta(X) \le \delta) \le (\gamma\delta/B)^\alphaPX​(0<Δ(X)≤δ)≤(γδ/B)α for all δ>0\delta > 0δ>0, and
  2. for every δ>0\delta > 0δ>0 and almost every xxx, PD(∥f^(x)−f∗(x)∥≥δ)≤C1exp⁡(−C2anδ2)\mathbb P_{\mathcal D}\bigl(\|\hat f(x) - f^*(x)\| \ge \delta\bigr) \le C_1 \exp(-C_2 a_n \delta^2)PD​(∥f^​(x)−f∗(x)∥≥δ)≤C1​exp(−C2​an​δ2),

then

Regret(πf^)≤C B an−1+α2.\mathrm{Regret}(\pi_{\hat f}) \le C\, B\, a_n^{-\frac{1+\alpha}{2}}.Regret(πf^​​)≤CBan−21+α​​.

With ana_nan​ of order nnn up to a logarithmic factor, as for well-specified least squares, the rate n−(1+α)/2n^{-(1+\alpha)/2}n−(1+α)/2 is, up to logarithms, faster than the rate n−(1+α)/(2+α)n^{-(1+\alpha)/(2+\alpha)}n−(1+α)/(2+α) that no method relying only on a policy class of finite Natarajan dimension can beat (Theorem 7 of the paper): estimate-then-optimize can outperform integrated methods.

Formalization Note The paper writes C(α,γ)C(\alpha, \gamma)C(α,γ) and calls C1,C2C_1, C_2C1​,C2​ universal constants; here CCC is chosen after α,γ,C1,C2\alpha, \gamma, C_1, C_2α,γ,C1​,C2​ and before everything else, which is that reading. The distribution is given as the law of XXX together with the conditional law of YYY given XXX. Plug-in policies are any selection from the argmin with values in Z∠\mathcal Z^\angleZ∠ (the paper's consistent tie-breaking is not required, which makes the statement stronger). The estimator and the policy are assumed jointly measurable in the data and the feature, so that the regret is a genuine integral; the paper leaves this implicit. Positivity of C1,C2C_1, C_2C1​,C2​ and of ana_nan​ is the paper's implicit convention.

Preamble
import Mathlib
import Definitions.Def_FastCLO_ETO_Model
open MeasureTheory ProbabilityTheory
open scoped InnerProductSpace ENNReal
Formal statement
namespace FastCLO.ETO

/-- **Theorem 8** (Hu, Kallus, Mao, *Fast Rates for Contextual Linear Optimization*,
arXiv:2011.03030v3, §3.2, p. 9). "Suppose Assumption 2 holds and, for universal constants C₁, C₂
and a sequence aₙ, f̂ satisfies that, for any δ > 0 and almost all x,
P(‖f̂(x) − f*(x)‖ ≥ δ) ≤ C₁ exp(−C₂ aₙ δ²). Then, for a constant C(α, γ) depending only on α, γ,
Regret(π_f̂) ≤ C(α, γ) B aₙ^{−(1+α)/2}."

Formalization Note: `C` is chosen after `α, γ` and the universal constants `C₁, C₂`, and before
the dimensions, the polytope, the distribution, the sample size `n`, the estimator, the policy and
`aₙ` (written `a > 0`, needed for the real power). The distribution is `(μ, κ)` (law of `X`,
conditional law of `Y`), `f*` is the conditional mean, and the regret is measured against the
optimal value. The estimator `fhat D` and the plug-in policy `pihat D` are computed from the data
`D` (any selection from the argmin with values in `Z∠`; tie-breaking not encoded), assumed jointly
measurable in `(D, x)` so that the regret is a genuine integral. The tail condition bounds, for every
`δ > 0` and almost every fixed `x`, the probability over the data. `C₁, C₂ > 0` is the page's
implicit positivity of the constants. -/
theorem theorem_8 (α γ C₁ C₂ : ℝ) (hα : 0 ≤ α) (hγ : 0 ≤ γ) (hC₁ : 0 < C₁) (hC₂ : 0 < C₂) :
    ∃ C : ℝ, ∀ (p d : ℕ) (P : Polytope d) (I : Instance p d) (n : ℕ)
      (fhat pihat : (Fin n → FastCLO.ERM.Vec p × FastCLO.ERM.Vec d) → FastCLO.ERM.Vec p → FastCLO.ERM.Vec d) (a : ℝ),
      0 < a →
      NoiseCond P I α γ →
      (∀ D, IsPlugIn P (fhat D) (pihat D)) →
      Measurable (Function.uncurry fhat) →
      Measurable (Function.uncurry pihat) →
      (∀ δ > 0, ∀ᵐ x ∂I.μ,
        I.sample n {D | δ ≤ ‖fhat D x - I.fstar x‖} ≤
          ENNReal.ofReal (C₁ * Real.exp (-C₂ * a * δ ^ 2))) →
      regret P I n pihat ≤ C * P.B * a ^ (-(1 + α) / 2) := by sorry

end FastCLO.ETO
Source
Hu, Kallus, Mao, Fast Rates for Contextual Linear Optimization, arXiv:2011.03030v3, Theorem 8, p. 9 (proof in Appendix A.5, p. 30)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me