arXiv (OAI Expanded)
open access
Bandits with Probing: Optimal Regret and the Limits of Winner Feedback
A learner probes at most $k$ of $n$ arms each round, receives the maximum of their rewards in $[0,1]$, and competes with the best fixed arm. When does the probing advantage pay for learning? We determine two minimax laws. Under independent stochastic rewards with winner feedback (the maximum and a w
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
- On the Complexity of Preference-Based Bandits#1144318
- Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivit#1143260
- Sharp Characterization of Bias in Post-Bandit Inference#1052257
- The Greedy Advantage in Finite-Horizon Bandits#422266
- Softmax gradient policy for variance minimization and risk-averse multi armed bandits#1063878
Record · ID 1109288
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