arXiv (OAI Expanded)
open access
Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification
In the best-arm identification problem, we are given $n$ stochastic arms with unknown means and wish to identify the arm with the largest mean with probability at least $1-δ$, using as few samples as possible. We consider independent Gaussian rewards with unit variance and means in $[0,1]$. Chen and
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
- A positive resolution of the gap-entropy conjecture#997400
- Jensen-type inequalities on pairs of measure spaces and their applications#1083804
- Tight Sample Bounds for Renyi and Min-Entropy Estimation#625535
- Tight Sample Bounds for Renyi and Min-Entropy Estimation#623262
- Improved Multiplayer Bandit Algorithm for Bernoulli Rewards#1062113
Record · ID 1071466
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