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.
Centered 1-sub-Gaussian reward
Definition
Let be an integrable real random variable on a probability space, and write . The reward is 1-sub-Gaussian if for every ,
The expectation in this condition is the nonnegative Lebesgue integral of the displayed exponential; the inequality requires it to be finite for every real .
Definition references
Random elements and real random variables: a real random variable is a measurable map into .
Expectation of a nonnegative or integrable random variable: expectation is the Lebesgue integral against the underlying probability measure, finite for an integrable real random variable.
The real exponential function and the number by a power series: is the real exponential function defined for every .
Tor Lattimore and Csaba Szepesvári, Bandit Algorithms: Definition 5.2, PDF p. 86 / printed p. 77; centered-noise convention, PDF p. 88 / printed p. 79.
Sébastien Bubeck and Nicolò Cesa-Bianchi, Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems: Equation (2.2), Chapter 2 §2.2, PDF p. 13 / printed p. 10.
Depends on
Used by
- A finite-mean polynomial-tail reward is not sub-Gaussian Example
- A two-arm deterministic gap and explore-then-commit Example
- A sharper expected suboptimal-arm pull count for the unchanged UCB rule Lemma
- Expected pull count for a suboptimal UCB arm Lemma
- Tail bounds for deterministic prefixes of independent sub-Gaussian rewards Lemma
- Expected regret of explore-then-commit Theorem
- Gap-dependent expected regret of UCB Theorem
- Gap-free expected regret of UCB Theorem
Dependency tree · two levels
14 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)
- Sébastien Bubeck and Nicolò Cesa-Bianchi, Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (standard reference, not scraped)