How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Exp4 expert reward estimates are conditionally unbiased
Statement
In Exp4, at every round and for every expert , the expert's estimated reward satisfies
The assertion includes rounds where some actions have zero sampling probability; no componentwise unbiasedness claim is made for an unsupported action.
Statement references
Exp4 estimates and zero-probability convention: the estimated action rewards and expert rewards are defined in the algorithm.
Facts & Assumptions
Given: A fixed oblivious instance with , , , the Exp4 algorithm, and a round .
Exp4 with unbiased estimated rewards: , every , , and the quotient in is set to zero when .
Contextual bandit protocol with finite expert advice: and are fixed before the learner's action, each advice row is a probability vector, and records the pre-action history.
Exp4 with unbiased estimated rewards: , , and for , .
Expectation of a nonnegative or integrable random variable: expectation is the Lebesgue integral; a measurable finite-range real random variable on a probability space is integrable.
Conditional expectation given a sigma algebra: conditional expectation is characterized by its integrals on pre-action history events; with a finite action set, its value on each positive-probability history is the finite conditional sum over actions.
Proof
For the fixed instance, there are finitely many action histories. The weights and finite estimates are functions of those histories and the current action, so they are measurable with finite ranges and hence integrable. Fix a positive-probability pre-action history; on it, and are fixed. If , then is a sum of nonnegative terms and every ; hence for every expert . Such a coordinate contributes nothing to any expert reward estimate.
For on this history, the estimate is when and zero otherwise. Thus its conditional mean, computed directly from [F3], is , regardless of other arms' probabilities. For fixed expert , its row sums to one, so . Distributing the finite conditional sum and omitting the zero coefficients from step 1.1 gives . These values on the finitely many positive-probability history atoms satisfy the integral characterization [F5] on every history event; values on null histories do not affect the conditional-expectation identity.
Depends on
Used by
Dependency tree · two levels
16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Tor Lattimore and Csaba Szepesvári, Bandit Algorithms (standard reference, not scraped)
- Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert Schapire, The Nonstochastic Multiarmed Bandit Problem (standard reference, not scraped)