Bandit Algorithms
Tor Lattimore and Csaba Szepesvári
- Location
- Parts VII–VIII as a background index
- Pages
- online pp. 358–538
Teaching chapter · canonical scope Planned
The proof harness, task vocabulary, resource stopping leaves, literature registry, a partial source-frozen delayed-feedback audit, and planned BwK, preference, robust, federated, neural-bandit, and sharp KL-asymptotic work.
Who should read this. Read this chapter to contribute a new route or understand what is deliberately not claimed.
Textbook crosswalk
The Book Map is a curated formalization curriculum anchored in Bandit Algorithms, not a chapter-for-chapter reproduction of one book. Page numbers below use its free online edition; companion papers cover algorithm-specific results.
Tor Lattimore and Csaba Szepesvári
Record the exact source, assumptions, constants, and intended Lean signature.
Search BanditRLlib, Mathlib, LML theorem cards, and paper/textbook evidence without upgrading cards to proofs.
Choose one narrow obligation with a clear compile gate and explicit dependencies.
Only a passing local Lean gate plus review can promote the leaf to compiled status.
Synchronize the declaration index, teaching note, dependencies, and remaining gaps.
The mathematical readings are explanatory summaries. The exact generated Lean statement and its source link remain authoritative for hypotheses, types, constants, and indexing.
Plain-English statement. The first time an adapted cumulative spending process reaches a fixed budget is a stopping time.
theorem isStoppingTime_budgetExhaustionTime_of_adapted {Omega : Type u} [mOmega : MeasurableSpace Omega] {F : Filtration Nat mOmega} {spent : Nat -> Omega -> Nat} (budget : Nat) (hspent : Adapted F spent) : IsStoppingTime F (budgetExhaustionTime spent budget)
Plain-English statement. A harness task records the target, task kind, status, source and scenario cards, profile, required artifacts, and acceptance gates used by the automation system.
structure HarnessTask where
| Module | Declarations | Project imports | Status |
|---|---|---|---|
BanditRLProof.Automation | 9 | 1 | Compiled |
BanditRLProof.BudgetStoppingTime | 3 | 0 | Compiled |
BanditRLProof.DelayedFeedback.Accounting | 17 | 0 | Compiled |
BanditRLProof.DelayedFeedback.ActionLaw | 10 | 2 | Compiled |
BanditRLProof.DelayedFeedback.ActiveAllocation | 8 | 1 | Compiled |
BanditRLProof.DelayedFeedback.CausalView | 11 | 1 | Compiled |
BanditRLProof.DelayedFeedback.Elimination | 9 | 1 | Compiled |
BanditRLProof.DelayedFeedback.MultiRegimeContract | 5 | 0 | Compiled |
BanditRLProof.DelayedFeedback.Processing | 9 | 1 | Compiled |
BanditRLProof.DelayedFeedback.StochasticGapOrderingAudit | 19 | 1 | Compiled |
BanditRLProof.DelayedFeedback.StochasticGoodEvent | 11 | 2 | Compiled |
BanditRLProof.DelayedFeedback.StochasticGoodEventAssembly | 13 | 2 | Compiled |
BanditRLProof.Literature | 3 | 3 | Compiled |
BanditRLProof.OpenProblems | 3 | 1 | Compiled |