arXiv (OAI Expanded)
open access
Nearly Minimax-Optimal Regret for Linear Contextual Bandits with Arbitrary Adaptive Action Sets
We study stochastic linear contextual bandits with arbitrary action menus that may depend on the fixed parameter and the interaction history. We establish matching upper and lower bounds, up to logarithmic factors. Let $d$ be the dimension, $K$ be the menu size, and $T$ the time horizon. For $2\le K
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
- Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates#665788
- Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates#664288
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- Calibration-Gated LLM Pseudo-Observations for Online Contextual Bandits#19029
- Softmax gradient policy for variance minimization and risk-averse multi armed bandits#1063878
Record · ID 1109220
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