Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Exp4 expert reward estimates are conditionally unbiased

Statement

In Exp4, at every round t∈[n] and for every expert m∈[M], the expert's estimated reward satisfies

E[X~t,m∣Ft−1]=⟨E(t)m,xt⟩.

The assertion includes rounds where some actions have zero sampling probability; no componentwise unbiasedness claim is made for an unsupported action.

Statement references

Exp4 estimates and zero-probability convention: the estimated action rewards and expert rewards are defined in the algorithm.

Facts & Assumptions

Given: A fixed oblivious instance with n≥1, k>1, M>1, the Exp4 algorithm, and a round t.

[F1]

Exp4 with unbiased estimated rewards: Pt,i=∑r=1MQt,rE(t)r,i, every Qt,r>0, X^t,i=1−Y^t,i, and the quotient in Y^t,i is set to zero when Pt,i=0.

[F2]

Contextual bandit protocol with finite expert advice: xt and E(t) are fixed before the learner's action, each advice row is a probability vector, and Ft−1 records the pre-action history.

[F3]

Exp4 with unbiased estimated rewards: P(At=i∣Ft−1)=Pt,i, Xt=xt,At, and for Pt,i>0, Y^t,i=1{At=i}(1−Xt)/Pt,i.

[F4]

Expectation of a nonnegative or integrable random variable: expectation is the Lebesgue integral; a measurable finite-range real random variable on a probability space is integrable.

[F5]

Conditional expectation given a sigma algebra: conditional expectation is characterized by its integrals on pre-action history events; with a finite action set, its value on each positive-probability history is the finite conditional sum over actions.

Proof

1.1F1F2F3F4algebra

For the fixed instance, there are finitely many action histories. The weights and finite estimates are functions of those histories and the current action, so they are measurable with finite ranges and hence integrable. Fix a positive-probability pre-action history; on it, Qt and E(t) are fixed. If Pt,i=0, then 0=∑rQt,rE(t)r,i is a sum of nonnegative terms and every Qt,r>0; hence E(t)r,i=0 for every expert r. Such a coordinate contributes nothing to any expert reward estimate.

2.1F1F2F3F4F5step 1.1algebra∎

For Pt,i>0 on this history, the estimate is (1−xt,i)/Pt,i when At=i and zero otherwise. Thus its conditional mean, computed directly from [F3], is Pt,i(1−xt,i)/Pt,i=1−xt,i, regardless of other arms' probabilities. For fixed expert m, its row sums to one, so X~t,m=1−∑iE(t)m,iY^t,i. Distributing the finite conditional sum and omitting the zero coefficients from step 1.1 gives E[X~t,m∣Ft−1]=1−∑i:Pt,i>0E(t)m,i(1−xt,i)=∑i=1kE(t)m,ixt,i. These values on the finitely many positive-probability history atoms satisfy the integral characterization [F5] on every history event; values on null histories do not affect the conditional-expectation identity.

Depends on

Used by

Dependency tree · two levels

16 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