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.
Bandit importance-weighted estimator
Definition
Let be integers, let , and let
On a probability space , let be the discrete filtration generated by the complete histories through round , with trivial; a complete pre-action history records past reward vectors, actions, and observed rewards. A reward vector is either fixed in advance or a deterministic function of the complete pre-action history. Thus, at a finite horizon with finitely many arms, there are finitely many possible histories. Before action is drawn, the current reward vector and sampling distribution are -measurable, and for every . The finite-valued measurable action has conditional law . The learner observes only and sets
The quantity is the importance-weighted loss estimate for arm , and is its corresponding reward estimate. A fixed reward sequence is the oblivious case; allowing to depend on the history available before is drawn gives the non-anticipating past-adaptive case. In either case the current reward vector is chosen before the current action. For finite horizons and finite action histories generated by such a fixed or deterministic history-dependent sequence, all these estimates are finite and integrable.
Definition references
Online decision protocol: the learner selects its round- action using prior history before round- feedback.
Adversary and feedback models: bandit feedback reveals only the played reward, and non-anticipating rewards are fixed before the current action.
Random elements and real random variables: a measurable finite-valued action is a random element of .
Filtration and filtered probability space: the round-history sigma-algebras are increasing and record information available before each action.
Conditional expectation given a sigma algebra: conditional expectation is characterized by equality of integrals on every event in the conditioning sigma-algebra.
Expectation of a nonnegative or integrable random variable: expectations of the finite integrable estimates are Lebesgue integrals on the probability space.
Depends on
Used by
- Exp3 with importance-weighted loss feedback Algorithm
- Exp4 with unbiased estimated rewards Algorithm
- A rarely sampled arm has a high-variance importance-weighted estimate Example
- Deterministic rewards can give a negative estimated reward Example
- Exp3 and full-information Hedge update differently Example
- Conditional moments of the bandit importance-weighted estimator Lemma
- Exp3 expected regret under bandit feedback Theorem
Dependency tree · two levels
13 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)