arxiv
PublishedJuly 29, 2026 at 4:00 AM
Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set
Publisher summary· verbatim
arXiv:2607.23679v1 Announce Type: new Abstract: Recent years have witnessed increasing interests in tackling heteroscedastic noise in bandits and reinforcement learning. In these works, the cumulative variance of the noise $\Lambda = \sum_{t=1}^T \sigma_t^2$, where $\sigma_t^2$ is the variance of th
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivOptimal Hydra: Model Heterogeneous Federated Learning for LLMs using Data-Informed Hydra-Nets18harxivJudging the Judges: Confidence and Disagreement in Rubrics as Rewards18harxivContent associations with answer selection and engagement in supply chain community question answering18harxivORACLE-SWE: Quantifying the Contribution of Critical Information Signals on SWE Agents18hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗