Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 n≥1, k>1, and M>1. Write [r]={1,…,r} for a positive integer r, and let

Δk={p∈[0,1]k:∑i=1kpi=1},E=ΔkM.

An oblivious contextual bandit instance consists of reward vectors xt∈[0,1]k and advice matrices E(t)∈E, for t∈[n], all fixed before the learner's private randomization. The matrix E(t) is revealed before the round-t action; its row E(t)m=(E(t)m,1,…,E(t)m,k) is expert m's probability distribution over the k actions. The expected reward of expert m on round t is ⟨E(t)m,xt⟩=∑i=1kE(t)m,ixt,i.

At round t, 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 Pt∈Δk, draws a measurable finite-valued action At∈[k] with conditional probabilities P(At=i∣Ft−1)=Pt,i, and observes only Xt=xt,At. Here Ft−1 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

Rn=E[max⁡m∈[M]∑t=1n⟨E(t)m,xt⟩−∑t=1nXt],

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

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