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}
ProvedFastCLO.ETO.theorem_8Let be a nonempty polytope with on and extreme points . Let have feature law on and bounded costs , with and gap . From i.i.d. observations an estimate of is formed, and the estimate-then-optimize policy chooses, at every , an extreme point minimizing over .
Fix and constants . There is a constant , depending only on , such that the following holds for every polytope, every distribution, every , every and every estimator. If
- the noise condition (Assumption 2) holds: for all , and
- for every and almost every , ,
then
With of order up to a logarithmic factor, as for well-specified least squares, the rate is, up to logarithms, faster than the rate 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 and calls universal constants; here is chosen after and before everything else, which is that reading. The distribution is given as the law of together with the conditional law of given . Plug-in policies are any selection from the argmin with values in (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 and of is the paper's implicit convention.
import Mathlib import Definitions.Def_FastCLO_ETO_Model open MeasureTheory ProbabilityTheory open scoped InnerProductSpace ENNReal
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.