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.
Contextual bandit protocol with finite expert advice
Definition
Fix integers , , and . Write for a positive integer , and let
An oblivious contextual bandit instance consists of reward vectors and advice matrices , for , all fixed before the learner's private randomization. The matrix is revealed before the round- action; its row is expert 's probability distribution over the actions. The expected reward of expert on round is .
At round , the learner's pre-action history consists of its earlier actions and observed rewards. Given that history and the revealed advice, it selects a distribution , draws a measurable finite-valued action with conditional probabilities , and observes only . Here is the sigma-algebra generated by the pre-action history. For every fixed expert sequence and reward sequence, the expected regret against the best fixed expert is
where expectation is over the learner's action draws. The regret random variable is bounded, so this expectation is finite. This protocol makes no stochastic generalization claim and imposes no shared-structure condition on the experts; it does not cover advice or rewards selected in response to the learner's current action.
Definition references
Online decision timing: the learner chooses each action from its pre-action history before observing current-round feedback.
Oblivious adversary and bandit feedback: an oblivious sequence is fixed before learner randomization, and bandit feedback reveals only the played reward.
Expected-regret convention: expected regret is the expectation of the specified measurable, integrable regret random variable.
Measurable random actions: a finite action draw is a measurable random element of the discrete action set.
Pre-action filtration: the sigma-algebras generated by successive histories form a filtration.
Expectation: the expectation of an integrable real random variable is its Lebesgue integral on the underlying probability space.
Depends on
Used by
- Exp4 with unbiased estimated rewards Algorithm
- A context-specific expert class with no shared policy structure Example
- A finite two-expert Exp4 instance Example
- Duplicated experts change Exp4's uniform prior mass Example
- Exp4 expert reward estimates are conditionally unbiased Lemma
- Exp4 updates are well-defined, including zero-probability actions Lemma
- Exp4 weighted estimated loss has conditional second moment at most k Lemma
- Exp4 expected regret against the best fixed expert Theorem
Dependency tree · two levels
12 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)