arXiv (All)
open access
Rethinking Successive Rejects Algorithms
In the best-arm identification problem, an algorithm adaptively selects arms to find the arm of the largest mean reward. Successive Rejects (SR) is a simple fixed-budget best-arm identification algorithm that eliminates one candidate arm at each phase. At first glance, SR seems to have limited adapt
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
- Minimizing the Age of Incorrect Information for Unknown Markovian Source#150677
- Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification#1071466
- Algorithmic Microaggressions#730288
- Security Implications of Predictable Fragment Identification Values#213421
- Anticipation and Risk – From the inverse problem to reverse computation#755849
Record · ID 1357706
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