Lean module · Foundations
BanditRLProof.Algorithms.HeavyTailSourcePolicy
Source-parameter robust UCB: round-robin initialization is a tie convention for unpulled arms; later choices maximize the source radius-four index using only the observed history. Paper round is zero-based decision time plus one.
Module map
Imports
BanditRLProof.HeavyTailSourceSchedule, BanditRLProof.HeavyTailArmLaw
Imported by
Declarations
Open an item to read its exact compact statement and source link. Detailed teaching notes are linked when registered.
def
BanditRLProof.HeavyTail.SourcePolicy.sampleThreshold
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.sampleThresholdReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def sampleThreshold (ε u : ℝ) (t s : ℕ) : ℝ
def
BanditRLProof.HeavyTail.SourcePolicy.historyIndex
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.historyIndexReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def historyIndex (initial : Fin K) (ε u : ℝ) (n : ℕ) (h : History.FinitePairHistory (Fin K) ℝ n) (arm : Fin K) : ℝ
def
BanditRLProof.HeavyTail.SourcePolicy.nextArm
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.nextArmReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def nextArm (hK : 0 < K) (ε u : ℝ) (n : ℕ) (h : History.FinitePairHistory (Fin K) ℝ n) : Fin K
theorem
BanditRLProof.HeavyTail.SourcePolicy.measurable_historyIndex
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.measurable_historyIndexReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_historyIndex (initial : Fin K) (ε u : ℝ) (n : ℕ) (arm : Fin K) : Measurable (fun h => historyIndex initial ε u n h arm)
theorem
BanditRLProof.HeavyTail.SourcePolicy.measurable_nextArm
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.measurable_nextArmReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_nextArm (hK : 0 < K) (ε u : ℝ) (n : ℕ) : Measurable (nextArm hK ε u n)
def
BanditRLProof.HeavyTail.SourcePolicy.robustAction
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Heavy-tailed bandits
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustActionReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def robustAction (hK : 0 < K) (ε u : ℝ)
def
BanditRLProof.HeavyTail.SourcePolicy.robustReward
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustRewardReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def robustReward (hK : 0 < K) (ε u : ℝ)
theorem
BanditRLProof.HeavyTail.SourcePolicy.measurable_robustAction
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.measurable_robustActionReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem measurable_robustAction (hK : 0 < K) (ε u : ℝ) (t : ℕ) : Measurable (fun stream => robustAction hK ε u stream t)
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustAction_initialization
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustAction_initializationReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustAction_initialization (hK : 0 < K) (ε u : ℝ) (stream : UCB.ArmRewardStream K) (t : ℕ) (ht : t < K) : robustAction hK ε u stream t = UCB.initializationArm hK t
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustAction_maximizes
Compiled
The selected index is maximal on the actual observed history.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustAction_maximizesReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustAction_maximizes (hK : 0 < K) (ε u : ℝ) (stream : UCB.ArmRewardStream K) (n : ℕ) (hn : K ≤ n+1) (arm : Fin K) : let h := ArmStreamPolicy.history (UCB.initializationArm hK 0) (nextArm hK ε u) stream n historyIndex (UCB.initializationArm hK 0) ε u n h arm ≤ historyIndex (UCB.initializationArm hK 0) ε u n h (robustAction hK ε u stream (n+1))
def
BanditRLProof.HeavyTail.SourcePolicy.robustMean
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustMeanReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
noncomputable def robustMean (hK : 0 < K) (ε u : ℝ) (stream : UCB.ArmRewardStream K) (arm : Fin K) (t : ℕ) : ℝ
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustMean_latent
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustMean_latentReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustMean_latent (hK : 0 < K) (ε u : ℝ) (stream : UCB.ArmRewardStream K) (arm : Fin K) (t : ℕ) : robustMean hK ε u stream arm t = (∑ s ∈ Finset.range (pullCount (robustAction hK ε u stream) arm t), truncate (sampleThreshold ε u t s) (stream s arm)) / pullCount (robustAction hK ε u stream) arm t
theorem
BanditRLProof.HeavyTail.SourcePolicy.robust_pullCount_pos
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robust_pullCount_posReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robust_pullCount_pos (hK : 0 < K) (ε u : ℝ) (stream : UCB.ArmRewardStream K) (arm : Fin K) (t : ℕ) (ht : K ≤ t) : 0 < pullCount (robustAction hK ε u stream) arm t
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustMean_history
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustMean_historyReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustMean_history (hK : 0 < K) (ε u : ℝ) (stream : UCB.ArmRewardStream K) (arm : Fin K) (n : ℕ) : historyTruncatedMean (UCB.initializationArm hK 0) (sampleThreshold ε u (n+1)) n (ArmStreamPolicy.history (UCB.initializationArm hK 0) (nextArm hK ε u) stream n) arm = robustMean hK ε u stream arm (n+1)
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustIndex_history
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustIndex_historyReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustIndex_history (hK : 0 < K) (ε u : ℝ) (stream : UCB.ArmRewardStream K) (arm : Fin K) (n : ℕ) : historyIndex (UCB.initializationArm hK 0) ε u n (ArmStreamPolicy.history (UCB.initializationArm hK 0) (nextArm hK ε u) stream n) arm = robustMean hK ε u stream arm (n+1) + sourceConfidenceRadius ε u (n+1) (pullCount (robustAction hK ε u stream) arm (n+1))
theorem
BanditRLProof.HeavyTail.SourcePolicy.arm_adaptive_upper_tail
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.arm_adaptive_upper_tailReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem arm_adaptive_upper_tail (ν : Kernel (Fin K) ℝ) [IsMarkovKernel ν] (arm : Fin K) (count : UCB.ArmRewardStream K → ℕ) (ε u : ℝ) (t : ℕ) (hε0 : 0 ≤ ε) (hε : ε ≤ 1) (hu0 : 0 < u) (hX : Integrable (fun x : ℝ => x) (ν arm)) (hm : Integrable (fun x : ℝ => |x|^(1+ε)) (ν arm)) (hu : (∫ x, |x|^(1+ε) ∂ν arm) ≤ u) : (UCB.armStreamMeasure ν).real {stream | 0 < count stream ∧ count stream ≤ t ∧ sourceConfidenceRadius ε u t (count stream) ≤ (∑ s ∈ Finset.range (count stream), truncate (sampleThreshold ε u t s) (stream s arm)) / count stream - ∫ x, x ∂ν arm} ≤ t*Real.exp (-(5/4 : ℝ)*sourceConfidenceLog t)
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustMean_upper_tail
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustMean_upper_tailReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustMean_upper_tail (hK : 0 < K) (ν : Kernel (Fin K) ℝ) [IsMarkovKernel ν] (arm : Fin K) (ε u : ℝ) (t : ℕ) (ht : K ≤ t) (hε0 : 0 ≤ ε) (hε : ε ≤ 1) (hu0 : 0 < u) (hX : Integrable (fun x : ℝ => x) (ν arm)) (hm : Integrable (fun x : ℝ => |x|^(1+ε)) (ν arm)) (hu : (∫ x, |x|^(1+ε) ∂ν arm) ≤ u) : (UCB.armStreamMeasure ν).real {stream | sourceConfidenceRadius ε u t (pullCount (robustAction hK ε u stream) arm t) ≤ robustMean hK ε u stream arm t - ∫ x, x ∂ν arm} ≤ t*Real.exp (-(5/4 : ℝ)*sourceConfidenceLog t)
theorem
BanditRLProof.HeavyTail.SourcePolicy.arm_adaptive_lower_tail
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.arm_adaptive_lower_tailReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem arm_adaptive_lower_tail (ν : Kernel (Fin K) ℝ) [IsMarkovKernel ν] (arm : Fin K) (count : UCB.ArmRewardStream K → ℕ) (ε u : ℝ) (t : ℕ) (hε0 : 0 ≤ ε) (hε : ε ≤ 1) (hu0 : 0 < u) (hX : Integrable (fun x : ℝ => x) (ν arm)) (hm : Integrable (fun x : ℝ => |x|^(1+ε)) (ν arm)) (hu : (∫ x, |x|^(1+ε) ∂ν arm) ≤ u) : (UCB.armStreamMeasure ν).real {stream | 0 < count stream ∧ count stream ≤ t ∧ sourceConfidenceRadius ε u t (count stream) ≤ (∫ x, x ∂ν arm) - (∑ s ∈ Finset.range (count stream), truncate (sampleThreshold ε u t s) (stream s arm)) / count stream} ≤ t*Real.exp (-(5/4 : ℝ)*sourceConfidenceLog t)
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustMean_lower_tail
Compiled
No declaration docstring is present; use the chapter context and exact statement below.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustMean_lower_tailReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustMean_lower_tail (hK : 0 < K) (ν : Kernel (Fin K) ℝ) [IsMarkovKernel ν] (arm : Fin K) (ε u : ℝ) (t : ℕ) (ht : K ≤ t) (hε0 : 0 ≤ ε) (hε : ε ≤ 1) (hu0 : 0 < u) (hX : Integrable (fun x : ℝ => x) (ν arm)) (hm : Integrable (fun x : ℝ => |x|^(1+ε)) (ν arm)) (hu : (∫ x, |x|^(1+ε) ∂ν arm) ≤ u) : (UCB.armStreamMeasure ν).real {stream | sourceConfidenceRadius ε u t (pullCount (robustAction hK ε u stream) arm t) ≤ (∫ x, x ∂ν arm) - robustMean hK ε u stream arm t} ≤ t*Real.exp (-(5/4 : ℝ)*sourceConfidenceLog t)
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustMean_upper_tail_sum
Compiled
Finite time budget for one signed event of the actual source-parameter policy.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Heavy-tailed bandits
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustMean_upper_tail_sumReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustMean_upper_tail_sum (hK : 0 < K) (ν : Kernel (Fin K) ℝ) [IsMarkovKernel ν] (arm : Fin K) (ε u : ℝ) (T : ℕ) (hε0 : 0 ≤ ε) (hε : ε ≤ 1) (hu0 : 0 < u) (hX : Integrable (fun x : ℝ => x) (ν arm)) (hm : Integrable (fun x : ℝ => |x|^(1+ε)) (ν arm)) (hu : (∫ x, |x|^(1+ε) ∂ν arm) ≤ u) : (∑ t ∈ Finset.range T, (UCB.armStreamMeasure ν).real {stream | K ≤ t ∧ sourceConfidenceRadius ε u t (pullCount (robustAction hK ε u stream) arm t) ≤ robustMean hK ε u stream arm t - ∫ x, x ∂ν arm}) ≤ 2
theorem
BanditRLProof.HeavyTail.SourcePolicy.robustMean_lower_tail_sum
Compiled
Finite time budget for one signed event of the actual source-parameter policy.
Used in these reading views: Bandit Book
1. Finite bandits, traces, and regret
Indexed settings: Heavy-tailed bandits
Canonical node identity
declaration:BanditRLProof.HeavyTail.SourcePolicy.robustMean_lower_tail_sumReading membership is not a proof dependency. Exact assumptions remain in the Lean statement.
theorem robustMean_lower_tail_sum (hK : 0 < K) (ν : Kernel (Fin K) ℝ) [IsMarkovKernel ν] (arm : Fin K) (ε u : ℝ) (T : ℕ) (hε0 : 0 ≤ ε) (hε : ε ≤ 1) (hu0 : 0 < u) (hX : Integrable (fun x : ℝ => x) (ν arm)) (hm : Integrable (fun x : ℝ => |x|^(1+ε)) (ν arm)) (hu : (∫ x, |x|^(1+ε) ∂ν arm) ≤ u) : (∑ t ∈ Finset.range T, (UCB.armStreamMeasure ν).real {stream | K ≤ t ∧ sourceConfidenceRadius ε u t (pullCount (robustAction hK ε u stream) arm t) ≤ (∫ x, x ∂ν arm) - robustMean hK ε u stream arm t}) ≤ 2