Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 — Bandit swap regret lower bound

Proved
CalibeatBandit.theorem_4_1

by jasonhartline · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmic-game-theorybandit-algorithms

For some absolute constants c>0c>0c>0 and N0N_0N0​, for each integer N≥N0N\ge N_0N≥N0​ and each measurable randomized bandit policy on NNN actions, there is a deterministic oblivious sequence of reward vectors in [0,1]N[0,1]^N[0,1]N for which the expected swap regret at horizon T=N4T=N^4T=N4 is at least cN3/(log⁡N)6cN^3/(\log N)^6cN3/(logN)6. The learner’s next action is a measurable function of its private random seed and the rewards it observed on the previous rounds. This lower bound gives the hard instance used by the continuous pricing reduction.

Preamble
import Definitions.Def_CalibeatBandit_lower_bound_models
import Definitions.Def_CalibeatBandit_swapRegret

open CalibeatBandit MeasureTheory Set
Formal statement
theorem CalibeatBandit.theorem_4_1 :
    ∃ c : ℝ, 0 < c ∧ ∃ N₀ : ℕ, ∀ N : ℕ, N₀ ≤ N →
      ∀ {S : Type*} [MeasurableSpace S] (P : Measure S) [IsProbabilityMeasure P]
        (pick : (t : ℕ) → S → FeedbackHistory t → Fin N),
        (∀ t, Measurable (fun p : S × FeedbackHistory t => pick t p.1 p.2)) →
        ∃ y : ℕ → Fin N → ℝ, (∀ t i, y t i ∈ Icc 0 1) ∧
          c * (N : ℝ) ^ 3 / (Real.log N) ^ 6 ≤
            ∫ s, swapRegret (N ^ 4) y (fun t => pick t s (feedbackHistory (fun i => pick i s) y t)) ∂P := by sorry
Source
Hartline, Wang, Wu, Calibeating Bandit Advice, STOC 2027 submission 1457, Theorem 4.1 — Bandit swap regret lower bound

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me