arXiv (All)
open access
Rising Multi-Armed Bandits with Known Horizons
Rising Multi-Armed Bandits (RMABs) model sequential decision problems where each arm's expected reward improves with repeated pulls. In such problems, the value of investing in an arm depends on how much time remains, making knowledge of the horizon useful side information, yet its benefit remains u
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
- Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivit#1143260
- 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
- Softmax gradient policy for variance minimization and risk-averse multi armed bandits#1063878
- Adaptive inference for functionals of M-estimands#1144241
Record · ID 1142620
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