Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 X be an integrable real random variable on a probability space, and write μ=E[X]. The reward X is 1-sub-Gaussian if for every λ∈R,

E ⁣[exp⁡ ⁣(λ(X−μ))]≤exp⁡ ⁣(λ22).

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 (R,B(R)).

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 e by a power series: exp⁡(x) is the real exponential function defined for every x∈R.

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

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