Alphabeta Math
AlgorithmAlgorithm: 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.

Exp4 with unbiased estimated rewards

Definition

Given integers n≥1, k>1, M>1, a learning rate η>0, and an instance from the contextual bandit protocol with finite expert advice, initialize Q1,m=1/M for m∈[M]. For rounds t=1,…,n, perform the following operations:

  1. Receive the advice matrix E(t), whose mth row is E(t)m∈Δk.

  2. Form the action distribution

Pt,i=∑m=1MQt,mE(t)m,i,i∈[k].
  1. Draw a measurable action At∈[k] with conditional probabilities P(At=i∣Ft−1)=Pt,i and observe only Xt=xt,At.

  2. For each i∈[k], form

X^t,i=1−1{At=i}(1−Xt)Pt,i.

When Pt,i=0, the action At=i is impossible; in this case the quotient term is defined to be zero on every possible outcome.

  1. For each expert m∈[M], form its estimated reward
X~t,m=∑i=1kE(t)m,iX^t,i

and update the expert distribution by

Qt+1,m=Qt,mexp⁡(ηX~t,m)∑r=1MQt,rexp⁡(ηX~t,r).

The output is (Qt,Pt,At,Xt,X^t,X~t)t=1n and Qn+1. All arithmetic is over exact real numbers, and the procedure assumes a probability space carrying the stated finite-valued measurable draws. This is the γ=0 Exp4 update; no regret guarantee for bounded-loss Hedge is part of the algorithm.

Definition references

Contextual bandit protocol: the fixed oblivious reward/advice instance, action set, observed reward, and pre-action history used here.

Normalized exponential weights: the full-information algorithm uses normalized exponential weights; this is notation only, not a regret result for the present unbounded estimates.

Importance-weighted loss estimate: on coordinates with positive sampling probability, the quotient term is the standard estimate of loss 1−Xt; the zero-probability convention is handled locally here.

Measurable finite actions: each action draw is a measurable finite-valued random element.

Real exponential: the update uses the real exponential function.

Exponential positivity: exponential weights are positive for every finite real input.

Exp4 well-definedness ↗: the separate result proves finite estimates, simplex mixtures, positive expert weights and finite-horizon completion, including zero-probability actions.

Depends on

Used by

Dependency tree · two levels

23 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