arXiv (All)
open access
Sharp Non-Asymptotic Analysis of the Penalized Challenger in $β$-EB-TCI for Bernoulli Bandits
Top-two algorithms are simple and effective for fixed-confidence best-arm identification, but their sharp non-asymptotic behavior is still not well understood. We study this problem for Bernoulli bandits through $β$-EB-TCI, the empirical-best top-two rule of Jourdan et al., whose challenger is chose
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
- Pollak's Minimax Quickest Change Detection: Non-Asymptotic Optimality#794270
- Pollak's Minimax Quickest Change Detection: Non-Asymptotic Optimality#790251
- Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set#173252
- Gap Entropy and Almost Instance-Wise Optimal Best-Arm Identification#1071466
- Sharper Regret Bounds for Time-Varying Gaussian Process Bandits with Constant Exploration#467142
Record · ID 1157222
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