arXiv (All)
open access
Exact Bayes Regret and Asymptotic Optimality in High-Dimensional Gaussian Bandits
We study Bayesian linear bandits with an isotropic Gaussian parameter, independent Gaussian candidate arms, and Gaussian reward noise when the horizon is proportional to the dimension. The normalized posterior uncertainty has an explicit limit that is uniform over all causal policies. Gaussian poste
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- General bounds on Bayes errors for regression with Gaussian processes#230073
- Convergence Analysis of a Greedy Algorithm for Conditioning Gaussian Random Variables#1014492
- Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization#174005
- Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization#173427
- Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization#173177
Record · ID 1076374
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive