Alphabeta Math

Linear contextual bandits and LinUCB

About this page
Pipeline-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.

✓ 9 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Bayesian Computational Statistics
Combinatorics
Coxeter Groups
Functional Analysis
Linear Algebra
Machine Learning Algorithms
Measure Theory
Number Theory
Probability
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Lemma

The elliptical-potential bound for ridge design matrices

Lemma

Trace control of the regularized design determinant

Lemma

Conditional sub-Gaussian bounds allow bounded predictable coefficients

Definition

Finite-dimensional linear contextual bandit model

Lemma

The ridge information matrix is positive definite and invertible

Lemma

The ridge estimates and self-normalized sums are measurable

Lemma

The conditional Gaussian mixture is a nonnegative supermartingale

Algorithm

LinUCB with a self-normalized confidence radius

Theorem

The ridge estimate lies in a time-uniform linear confidence ellipsoid

Theorem

LinUCB has a log-determinant high-probability pseudo-regret bound

Corollary

LinUCB has expected pseudo-regret of order d√n log(nL)

Sources