arXiv (All)
open access
Optimal Online Regret for Context-Lumpable Bandits
We study stochastic contextual bandits with an unknown context-lumpable structure. The $S$ contexts are partitioned into $r$ blocks, and every arm has the same mean reward across contexts in the same block. Under arbitrary context distributions and without separation assumptions, we design an algori
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
- Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation#370350
- Official Review · NEURIPS 2023#787072
- Diversified Multinomial Logit Contextual Bandits#1118649
- Trading off rewards and errors in multi-armed bandits#1199819
- $δ$-mem: Efficient Online Memory for Large Language Models#1129260
Record · ID 1343773
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