arXiv — cs.AI preprintsInternational5 October 2026
Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.02771v1 Announce Type: cross Abstract: We study fixed-confidence best-arm identification under strict 1-bit feedback constraints. At each round, the learner selects an arm and a query set, and receives only a single bit indicating whether the sampled reward belongs to that set. We consider a distribution-free finite-variance setting with arm-wise localization, where direct empirical mean estimation is no longer available and clipping becomes unavoidable. We first formulate a time-uniform 1-bit mean-estimation primitive based on randomized threshold queries and a clipped tail-integra
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- MintFlow: Minimal Trajectory Intervention for Constrained Flow Matching5 October 2026
- Fast Models, Slow Evidence: A Paired and Self-Audited Evaluation of System-1 Decision Models for LLM Agent Harnesses5 October 2026
- The AI Risk Observatory: What Can We Learn from AI Disclosures in Annual Reports About Societal Resilience?5 October 2026
- Keep It CALM: Analyzing the Limits of Global Unsafety in Text-to-Image Generation5 October 2026
- Choosing Before Acting: Comparative Value Estimation for Long-Horizon Tool-Use Agents5 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.