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.

Bandit importance-weighted estimator

Definition

Let k,n≥1 be integers, let [k]={1,…,k}, and let

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

On a probability space (Ω,F,P), let (Ft)t=0n be the discrete filtration generated by the complete histories through round t, with F0 trivial; a complete pre-action history records past reward vectors, actions, and observed rewards. A reward vector is either fixed in advance or a deterministic function of the complete pre-action history. Thus, at a finite horizon with finitely many arms, there are finitely many possible histories. Before action At is drawn, the current reward vector xt=(xt,1,…,xt,k)∈[0,1]k and sampling distribution Pt=(Pt,1,…,Pt,k)∈Δk are Ft−1-measurable, and Pt,i>0 for every i. The finite-valued measurable action At∈[k] has conditional law P(At=i∣Ft−1)=Pt,i. The learner observes only Xt=xt,At and sets

Yt=1−Xt,yt,i=1−xt,i,Y^t,i=1{At=i}YtPt,i,X^t,i=1−Y^t,i.

The quantity Y^t,i is the importance-weighted loss estimate for arm i, and X^t,i is its corresponding reward estimate. A fixed reward sequence is the oblivious case; allowing xt to depend on the history available before At is drawn gives the non-anticipating past-adaptive case. In either case the current reward vector is chosen before the current action. For finite horizons and finite action histories generated by such a fixed or deterministic history-dependent sequence, all these estimates are finite and integrable.

Definition references

Online decision protocol: the learner selects its round-t action using prior history before round-t feedback.

Adversary and feedback models: bandit feedback reveals only the played reward, and non-anticipating rewards are fixed before the current action.

Random elements and real random variables: a measurable finite-valued action is a random element of [k].

Filtration and filtered probability space: the round-history sigma-algebras are increasing and record information available before each action.

Conditional expectation given a sigma algebra: conditional expectation is characterized by equality of integrals on every event in the conditioning sigma-algebra.

Expectation of a nonnegative or integrable random variable: expectations of the finite integrable estimates are Lebesgue integrals on the probability space.

Depends on

Used by

Dependency tree · two levels

13 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