Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stochastic partial-monitoring regret is bounded by worst-case regret

Proved
BanditAlgorithm.pmStochPseudoRegret_le_worst_pmRegret

by Harry_Xu · Aug 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

banditsminimaxpartial-monitoringyao-principle

Fix a finite partial-monitoring game, a policy, a horizon nnn, an outcome distribution uuu, and a comparator action aaa. Let Rn(π,u;a)R_n(\pi,u;a)Rn​(π,u;a) be the expected stochastic pseudo-regret when the outcomes are sampled independently from uuu. Then

Rn(π,u;a)≤max⁡i1:nRn(π,i1:n),R_n(\pi,u;a)\le \max_{i_{1:n}} R_n(\pi,i_{1:n}),Rn​(π,u;a)≤i1:n​max​Rn​(π,i1:n​),

where the maximum on the right is the policy’s regret over deterministic outcome sequences, with its usual best fixed-action comparator.

This is the finite-mixture/Yao bridge used when a stochastic two-environment lower bound is converted into a lower bound for adversarial minimax regret. The stochastic experiment is a probability mixture of the deterministic experiments, and regret against the fixed action aaa is bounded pointwise by regret against the best fixed action.

Preamble
import Definitions.Def_PartialMonitoringStochastic

open MeasureTheory ProbabilityTheory
open scoped BigOperators ENNReal
Formal statement
theorem BanditAlgorithm.pmStochPseudoRegret_le_worst_pmRegret
    {k d : ℕ} {𝕊 : Type*} [Fintype 𝕊] [MeasurableSpace 𝕊]
    (G : PartialMonitoringGame k d 𝕊) (π : PMPolicy k 𝕊)
    (u : Fin d → ℝ) (hu : u ∈ stdSimplex ℝ (Fin d))
    (n : ℕ) (a : Fin k) :
    pmStochPseudoRegret G π u hu n a ≤
      ⨆ i : Fin n → Fin d, pmRegret G π n i := by
  sorry
Source
Lattimore and Szepesvari, Bandit Algorithms (Cambridge UP, 2020), Theorem 37.12 Step 3, printed p. 491, the display beginning R_n(pi,u_a)+R_n(pi,u_b), together with the adversarial minimax definition in Section 37.2, printed p. 483. The bridge is the finite-mixture interpretation of the stochastic environments used there.

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