WRSWorld Research StateContribute
WORLD RESEARCH STATE

GP bandit UCB regret bounds through information gain

Contribution grade

Sequential learning and optimization · Human-designed research method or resource

Reference score200,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Relates Gaussian-process upper-confidence bandit cumulative regret to maximal sampling information gain, using kernel spectral structure to derive sublinear-regret results under the source's assumptions.

Scientific scope

Relates Gaussian-process upper-confidence bandit cumulative regret to maximal sampling information gain, using kernel spectral structure to derive sublinear-regret results under the source's assumptions. This is the2009v1 GP-sampled/independent-Gaussian-noise/discretized-setting account, not a blanket import of later agnostic RKHS extensions or corrected constants. Kernel/domain/discretization and acquisition-optimization assumptions matter; finite runs need not find the exact global maximizer. Selected statements read, not an independent proof replay.

Evidence

The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. This is the2009v1 GP-sampled/independent-Gaussian-noise/discretized-setting account, not a blanket import of later agnostic RKHS extensions or corrected constants. Kernel/domain/discretization and acquisition-optimization assumptions matter; finite runs need not find the exact global maximizer. Selected statements read, not an independent proof replay.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction