BanditRLlib
Lean gate passed before this site build; local proof declarations are shown as compiled.Lean-verified build · exact declarations linked.

Lean module · EXP3

BanditRLProof.Exp3SampledHistoryScore

This module closes the input-score boundary of Exp3RecursiveTrajectory for real-valued observed losses. The score at an inclusive finite history is the previous score plus the importance-weighted loss of the newly observed pair. The probability in that increment is exactly the exploration-mixed policy computed from the preceding score and history prefix.

Module map

Declarations
14
Placeholders
0

Imports

BanditRLProof.Exp3RecursiveTrajectory

Imported by

BanditRLProof, BanditRLProof.Exp3PredictableAdversary, BanditRLProof.TsallisFTRLRecursiveTrajectory

Declarations

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

def BanditRLProof.Exp3.previousPairHistory Compiled

Remove the newest coordinate from an inclusive successor pair history.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.previousPairHistory

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

def previousPairHistory {Action : Type u} {n : Nat} (history : History.FinitePairHistory Action Real (n + 1)) : History.FinitePairHistory Action Real n
theorem BanditRLProof.Exp3.measurable_previousPairHistory Compiled

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

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.measurable_previousPairHistory

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_previousPairHistory {Action : Type u} [MeasurableSpace Action] {n : Nat} : Measurable (previousPairHistory (Action := Action) (n := n))
theorem BanditRLProof.Exp3.measurable_observedImportanceWeightedLoss Compiled

Measurability of one importance-weighted coordinate when only the sampled action and its scalar observed loss are available.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.measurable_observedImportanceWeightedLoss

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_observedImportanceWeightedLoss {History : Type*} {Action : Type u} [MeasurableSpace History] [MeasurableSpace Action] [MeasurableSingletonClass Action] [DecidableEq Action] (prob : History -> Action -> Real) (chosen : History -> Action) (observedLoss : History -> Real) (action : Action) (hprob : Measurable (fun history => prob history action)) (hchosen : Measurable chosen) (hloss : Measurable observedLoss) : Measurable (fun history => importanceWeightedLoss (prob history) (fun _ => observedLoss history) (chosen history) action)
def BanditRLProof.Exp3.sampledHistoryScore Compiled

The cumulative sampled importance-weighted loss through an inclusive history. At time zero the estimator uses the initial action law. At time `n + 1`, it uses the exploration-mixed law generated from the score on the prefix through `n`, exactly matching `HistoryAlgorithm.policy n`.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledHistoryScore

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

noncomputable def sampledHistoryScore {Action : Type u} [DecidableEq Action] (arms : Finset Action) (eta gamma : Real) : (n : Nat) -> History.FinitePairHistory Action Real n -> Action -> Real | 0, history, action => importanceWeightedLoss (initialExploredDistribution arms eta gamma) (fun _ => (history ⟨0, Finset.mem_Iic.mpr le_rfl⟩).2) (history ⟨0, Finset.mem_Iic.mpr le_rfl⟩).1 action | n + 1, history, action => let previous := previousPairHistory history sampledHistoryScore arms eta gamma n previous action + importanceWeightedLoss (exploredHistoryDistribution arms eta gamma (sampledHistoryScore arms eta gamma n) previous) (fun _ => (history ⟨n + 1, Finset.mem_Iic.mpr le_rfl⟩).2) (history ⟨n + 1, Finset.mem_Iic.mpr le_rfl⟩).1 action @[simp] theorem sampledHistoryScore_zero {Action : Type u} [DecidableEq Action] (arms : Finset Action) (eta gamma : Real) (history : History.FinitePairHistory Action Real 0) (action : Action) : sampledHistoryScore arms eta gamma 0 history action = importanceWeightedLoss (initialExploredDistribution arms eta gamma) (fun _ => (history ⟨0, Finset.mem_Iic.mpr le_rfl⟩).2) (history ⟨0, Finset.mem_Iic.mpr le_rfl⟩).1 action
theorem BanditRLProof.Exp3.sampledHistoryScore_zero Compiled

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

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledHistoryScore_zero

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem sampledHistoryScore_zero {Action : Type u} [DecidableEq Action] (arms : Finset Action) (eta gamma : Real) (history : History.FinitePairHistory Action Real 0) (action : Action) : sampledHistoryScore arms eta gamma 0 history action = importanceWeightedLoss (initialExploredDistribution arms eta gamma) (fun _ => (history ⟨0, Finset.mem_Iic.mpr le_rfl⟩).2) (history ⟨0, Finset.mem_Iic.mpr le_rfl⟩).1 action
theorem BanditRLProof.Exp3.sampledHistoryScore_succ Compiled

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

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledHistoryScore_succ

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem sampledHistoryScore_succ {Action : Type u} [DecidableEq Action] (arms : Finset Action) (eta gamma : Real) (n : Nat) (history : History.FinitePairHistory Action Real (n + 1)) (action : Action) : sampledHistoryScore arms eta gamma (n + 1) history action = sampledHistoryScore arms eta gamma n (previousPairHistory history) action + importanceWeightedLoss (exploredHistoryDistribution arms eta gamma (sampledHistoryScore arms eta gamma n) (previousPairHistory history)) (fun _ => (history ⟨n + 1, Finset.mem_Iic.mpr le_rfl⟩).2) (history ⟨n + 1, Finset.mem_Iic.mpr le_rfl⟩).1 action
theorem BanditRLProof.Exp3.measurable_sampledHistoryScore Compiled

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

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.measurable_sampledHistoryScore

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurable_sampledHistoryScore {Action : Type u} [MeasurableSpace Action] [MeasurableSingletonClass Action] [DecidableEq Action] (arms : Finset Action) (eta gamma : Real) : forall n action, action ∈ arms -> Measurable (fun history : History.FinitePairHistory Action Real n => sampledHistoryScore arms eta gamma n history action)
theorem BanditRLProof.Exp3.measurableFiniteHistoryScore_sampledHistoryScore Compiled

The concrete sampled score satisfies the generic measurable-score API.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.measurableFiniteHistoryScore_sampledHistoryScore

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem measurableFiniteHistoryScore_sampledHistoryScore {Action : Type u} [MeasurableSpace Action] [MeasurableSingletonClass Action] [DecidableEq Action] (arms : Finset Action) (eta gamma : Real) : MeasurableFiniteHistoryScore arms (sampledHistoryScore arms eta gamma) where
def BanditRLProof.Exp3.sampledHistoryDistribution Compiled

Concrete exploration-mixed probabilities generated by sampled losses.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledHistoryDistribution

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

noncomputable def sampledHistoryDistribution {Action : Type u} [DecidableEq Action] (arms : Finset Action) (eta gamma : Real) (n : Nat) : History.FinitePairHistory Action Real n -> Action -> Real
theorem BanditRLProof.Exp3.sampledHistoryDistribution_floor Compiled

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

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledHistoryDistribution_floor

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem sampledHistoryDistribution_floor {Action : Type u} [DecidableEq Action] (arms : Finset Action) (harms : arms.Nonempty) (eta gamma : Real) (hgamma_le_one : gamma <= 1) (n : Nat) (history : History.FinitePairHistory Action Real n) (action : Action) : gamma / (arms.card : Real) <= sampledHistoryDistribution arms eta gamma n history action
def BanditRLProof.Exp3.sampledImportanceWeightedHistoryAlgorithm Compiled

The concrete stochastic history algorithm for sampled-loss EXP3.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledImportanceWeightedHistoryAlgorithm

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

noncomputable def sampledImportanceWeightedHistoryAlgorithm {Action : Type u} [MeasurableSpace Action] [MeasurableSingletonClass Action] [DecidableEq Action] (arms : Finset Action) (harms : arms.Nonempty) (eta gamma : Real) (hgamma_nonneg : 0 <= gamma) (hgamma_le_one : gamma <= 1) : Thompson.HistoryAlgorithm Action Real
theorem BanditRLProof.Exp3.sampledImportanceWeightedHistoryAlgorithm_policy Compiled

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

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledImportanceWeightedHistoryAlgorithm_policy

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem sampledImportanceWeightedHistoryAlgorithm_policy {Action : Type u} [MeasurableSpace Action] [MeasurableSingletonClass Action] [DecidableEq Action] (arms : Finset Action) (harms : arms.Nonempty) (eta gamma : Real) (hgamma_nonneg : 0 <= gamma) (hgamma_le_one : gamma <= 1) (n : Nat) : (sampledImportanceWeightedHistoryAlgorithm arms harms eta gamma hgamma_nonneg hgamma_le_one).policy n = finiteActionKernel arms (sampledHistoryDistribution arms eta gamma n) (exploredHistoryDistributionSource arms harms eta gamma (sampledHistoryScore arms eta gamma) (measurableFiniteHistoryScore_sampledHistoryScore arms eta gamma) hgamma_nonneg hgamma_le_one n)
def BanditRLProof.Exp3.sampledImportanceWeightedTrajectoryKernel Compiled

Complete recursive sampled-loss EXP3 trajectory kernel.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledImportanceWeightedTrajectoryKernel

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

noncomputable def sampledImportanceWeightedTrajectoryKernel {Env : Type w} {Action : Type u} [MeasurableSpace Env] [MeasurableSpace Action] [MeasurableSingletonClass Action] [DecidableEq Action] [Nonempty Action] (arms : Finset Action) (harms : arms.Nonempty) (eta gamma : Real) (hgamma_nonneg : 0 <= gamma) (hgamma_le_one : gamma <= 1) (environment : Thompson.MeasurableHistoryEnvironment Env Action Real) : Kernel Env ((n : Nat) -> Action × Real)
theorem BanditRLProof.Exp3.sampledImportanceWeightedTrajectoryMeasure_condDistrib_action Compiled

Every successor action of the concrete sampled-loss EXP3 trajectory has the exploration-mixed law generated from its recursively accumulated importance-weighted score.

Used in these reading views: Bandit Book · Online Learning Book

7. EXP3 and adversarial concentration

Canonical node identitydeclaration:BanditRLProof.Exp3.sampledImportanceWeightedTrajectoryMeasure_condDistrib_action

Reading membership is not a proof dependency. Exact assumptions remain in the Lean statement.

theorem sampledImportanceWeightedTrajectoryMeasure_condDistrib_action {Env : Type w} {Action : Type u} [MeasurableSpace Env] [StandardBorelSpace Env] [MeasurableSpace Action] [MeasurableSingletonClass Action] [StandardBorelSpace Action] [Nonempty Action] [DecidableEq Action] (prior : Measure Env) [IsFiniteMeasure prior] (arms : Finset Action) (harms : arms.Nonempty) (eta gamma : Real) (hgamma_nonneg : 0 <= gamma) (hgamma_le_one : gamma <= 1) (environment : Thompson.MeasurableHistoryEnvironment Env Action Real) (n : Nat) : condDistrib (fun sample : Env × ((k : Nat) -> Action × Real) => (sample.2 (n + 1)).1) (fun sample => Preorder.frestrictLe n sample.2) (prior ⊗ₘ sampledImportanceWeightedTrajectoryKernel arms harms eta gamma hgamma_nonneg hgamma_le_one environment) =ᵐ[ (prior ⊗ₘ sampledImportanceWeightedTrajectoryKernel arms harms eta gamma hgamma_nonneg hgamma_le_one environment).map (fun sample => Preorder.frestrictLe n sample.2)] finiteActionKernel arms (sampledHistoryDistribution arms eta gamma n) (exploredHistoryDistributionSource arms harms eta gamma (sampledHistoryScore arms eta gamma) (measurableFiniteHistoryScore_sampledHistoryScore arms eta gamma) hgamma_nonneg hgamma_le_one n)