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.
Exp3 with importance-weighted loss feedback
Definition
Let and be integers, and let . Use the finite-arm bandit protocol with rewards in and conditional sampling as specified in the bandit importance-weighted estimator definition. Initialize for each . For rounds , perform the following operations:
- Set
- Draw a measurable finite-valued action with conditional probabilities , and observe only .
- Form the loss estimates and reward estimates for every .
- Update for every .
The output is and . These operations use exact real arithmetic. The procedure assumes a probability space carrying the stated measurable draws; it makes no probability-space construction claim. Normalizing the weights is the exponential-weights step used by Hedge.
Definition references
Bandit importance-weighted estimator: the finite-arm reward protocol and loss/reward estimate definitions used at each round.
Hedge: initialize equal weights, normalize exponentials, draw an action, and update after feedback.
The real exponential function and the number by a power series: the real exponential used in the unnormalized weights.
The exponential is positive and satisfies : every exponential weight is positive.
Random elements and real random variables: each sampled arm is a measurable finite-valued random element.
Depends on
Used by
Dependency tree · two levels
21 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)