Prior-Free Competitive Ratios for Improving Bandits: Scale, Curvature and Horizon Are Free, but Not Jointly Under Noise
This story is from 2026-09-17. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2609.17595v1 Announce Type: new Abstract: In the improving multi-armed bandits problem, each of $k$ arms has an unknown nondecreasing, discretely concave reward curve $f_i$, and pulling arm $i$ for the $t$-th time yields $f_i(t)$. For sufficiently long horizons, Blum and Ravichandran (ALT 202…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-09-17 04:00 · arXiv cs.LG
Prior-Free Competitive Ratios for Improving Bandits: Scale, Curvature and Horizon Are Free, but Not Jointly Under Noise
More stories
- Trump announces a new 'AI Force,' but says he will not 'stifle' AI — Business Insider AI
- Anthropic, OpenAI, SpaceXAI, Google sued over call to ‘pace’ AI development — Politico Technology
- Introducing Kimi K3 on Amazon Bedrock — AWS Machine Learning Blog
- Introducing Amazon SageMaker HyperPod Inference Gateway — AWS Machine Learning Blog
- Introducing Astra for Law — OpenAI News
- Microsoft exec called AI scraping the “largest theft of labor in human history” — Ars Technica AI
- Google Joins OpenAI, Anthropic, Meta in Disclosing AI Hacks — Bloomberg AI
- Sources: Anthropic considers releasing a new AI model to counter OpenAI's momentum since Astra's launch, ahead of an IPO and after Amodei's call for a slowdown (Reuters) — Techmeme
Get the daily brief of stories like this at 6:30 every morning →