arXiv (All)
open access
Gaussian-Width Bounds for Offline-to-Online Linear Bandits
We study how offline data can help online learning in stochastic linear bandits. We focus on partially covered offline data, where only $k$ of the $d$ feature directions are poorly covered. Existing analyses of algorithms based on phased elimination and optimism give regret bounds of order $\widetil
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
- Low-Rank Single-Index Bandits with Unknown Links: From Matrices to Tensors#1117737
- Transfer Learning in Bandits from Unknown Adaptive Policies: Problem-Dependent Lower and Upper Bounds#1356918
- Online and offline robust multivariate linear regression#254155
- High-Order Error Bounds for Markovian LSA with Richardson-Romberg Extrapolation#1327249
- Curvature-Independent Regret Bounds for Distributed Online Optimization on Hadamard Manifolds#1071415
Record · ID 1297342
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