BanditRLlib
Lean gate passed before this site build; local proof declarations are shown as compiled.

Lean module · Tsallis-FTRL

BanditRLProof.TsallisFiniteArmIIDHorizonHistoryAdaptiveExpectedCorruptedRewardLaw

# Horizon-local history-adaptive expected corruption This module packages only the predictable reward-shift data used through a fixed finite horizon. The source is extended by zero after that horizon and then consumed by the existing all-time expected-corruption theorem route.

Module map

Declarations
19
Placeholders
0

Imports

BanditRLProof.TsallisFiniteArmIIDHistoryAdaptiveExpectedCorruptedRewardLaw

Imported by

BanditRLProof

Declarations

Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.

structure BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource Compiled

Predictable reward shifts and deterministic envelope witnesses needed only for rounds `0, ..., horizon`. Successor data are indexed by `Fin horizon`, so no measurability or boundedness contract is requested after the final round.

structure FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource (K horizon : Nat) where
def BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor Compiled

Successor shift obtained by extending a horizon-local source by zero.

noncomputable def finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (history : History.FinitePairHistory (Fin K) Real n) (arm : Fin K) : Real
def BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope Compiled

Deterministic envelope obtained by extending a horizon-local envelope by zero after its final successor round.

noncomputable def finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (t : Nat) (arm : Fin K) : Real
theorem BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor_of_lt Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor_of_lt {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : n < horizon) (history : History.FinitePairHistory (Fin K) Real n) (arm : Fin K) : finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor source n history arm = source.successor ⟨n, hn⟩ history arm
theorem BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor_of_le Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor_of_le {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : horizon <= n) (history : History.FinitePairHistory (Fin K) Real n) (arm : Fin K) : finiteArmIIDHorizonHistoryAdaptiveRewardShiftSuccessor source n history arm = 0
theorem BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope_zero Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope_zero {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (arm : Fin K) : finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope source 0 arm = source.initialEnvelope arm
theorem BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope_succ_of_lt Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope_succ_of_lt {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : n < horizon) (arm : Fin K) : finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope source (Nat.succ n) arm = source.successorEnvelope ⟨n, hn⟩ arm
theorem BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope_succ_of_le Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope_succ_of_le {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : horizon <= n) (arm : Fin K) : finiteArmIIDHorizonHistoryAdaptiveRewardShiftEnvelope source (Nat.succ n) arm = 0
def BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime Compiled

Zero extension of a horizon-local source to the all-time source interface. The supplied simp lemmas show that the extension is unchanged on every round used by the target horizon; it introduces no post-horizon regularity obligation.

noncomputable def FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) : FiniteArmIIDHistoryAdaptiveRewardShiftSource K where
theorem BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_initial Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_initial {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (arm : Fin K) : source.toAllTime.initial arm = source.initial arm
theorem BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_successor_of_lt Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_successor_of_lt {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : n < horizon) (history : History.FinitePairHistory (Fin K) Real n) (arm : Fin K) : source.toAllTime.successor n history arm = source.successor ⟨n, hn⟩ history arm
theorem BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_successor_of_le Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_successor_of_le {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : horizon <= n) (history : History.FinitePairHistory (Fin K) Real n) (arm : Fin K) : source.toAllTime.successor n history arm = 0
theorem BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_envelope_zero Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_envelope_zero {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (arm : Fin K) : source.toAllTime.envelope 0 arm = source.initialEnvelope arm
theorem BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_envelope_succ_of_lt Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_envelope_succ_of_lt {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : n < horizon) (arm : Fin K) : source.toAllTime.envelope (Nat.succ n) arm = source.successorEnvelope ⟨n, hn⟩ arm
theorem BanditRLProof.Tsallis.FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_envelope_succ_of_le Compiled

No declaration docstring is present; use the chapter context and exact statement below.

theorem FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource.toAllTime_envelope_succ_of_le {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (n : Nat) (hn : horizon <= n) (arm : Fin K) : source.toAllTime.envelope (Nat.succ n) arm = 0
def BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveCorruptedRewardLoss Compiled

Predictable clipped loss attached to the zero extension of a horizon-local reward-shift source.

noncomputable def finiteArmIIDHorizonHistoryAdaptiveCorruptedRewardLoss {K horizon : Nat} (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon)
def BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveExpectedRewardCorruptionBudgetForLaw Compiled

Exact generated-policy expected-corruption budget of a horizon-local source. Only rounds through `horizon` occur in the finite sum.

noncomputable def finiteArmIIDHorizonHistoryAdaptiveExpectedRewardCorruptionBudgetForLaw {K horizon : Nat} (model : FiniteBanditModel K) (armLaw : Fin K -> Measure Rat) (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) : Real
def BanditRLProof.Tsallis.finiteArmIIDHorizonHistoryAdaptiveExpectedCorruptionAllRegimeBound Compiled

All-regimes expected-corruption envelope for a horizon-local source.

noncomputable def finiteArmIIDHorizonHistoryAdaptiveExpectedCorruptionAllRegimeBound {K horizon : Nat} (model : FiniteBanditModel K) (armLaw : Fin K -> Measure Rat) (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) : Real
theorem BanditRLProof.Tsallis.integral_sampledScheduledHalfTsallisFiniteArmIIDHorizonHistoryAdaptiveExpectedCorruptedRewardLawRegret_le_allRegimes Compiled

Scheduled half-Tsallis regret under a finite-arm IID reward law and a history-adaptive reward-shift source whose regularity contract stops at the target horizon. The conclusion uses the exact generated-policy expected corruption and internally selects the refined or logarithmic branch.

theorem integral_sampledScheduledHalfTsallisFiniteArmIIDHorizonHistoryAdaptiveExpectedCorruptedRewardLawRegret_le_allRegimes {K horizon : Nat} (model : FiniteBanditModel K) (armLaw : Fin K -> Measure Rat) (hprob : forall arm, IsProbabilityMeasure (armLaw arm)) (hbound : forall arm, ∀ᵐ reward ∂armLaw arm, ((reward : Rat) : Real) ∈ Set.Icc (0 : Real) 1) (hmean : forall arm, integral (armLaw arm) (fun reward : Rat => ((reward : Rat) : Real)) = ((model.mean arm : Rat) : Real)) (source : FiniteArmIIDHorizonHistoryAdaptiveRewardShiftSource K horizon) (hgapPos : forall arm, arm ≠ model.bestArm -> 0 < ((model.gap arm : Rat) : Real)) (hgapLeOne : forall arm, arm ≠ model.bestArm -> ((model.gap arm : Rat) : Real) <= 1) : letI : Nonempty (Fin K)