arXiv Machine Learning June 30, 2026 By Toshinori Kitamura, Shuai Liu, Csaba Szepesv\'ari

Randomized Exploration for Linear Bandits via Absolute Perturbations

Read the original on arXiv Machine Learning →

arXiv:2606. 28616v1 Announce Type: new Abstract: In stochastic linear bandits, the canonical Upper Confidence Bound (UCB) algorithm admits a simple frequentist regret analysis but can be computationally demanding, while Thompson Sampling (TS) is computationally attractive yet typically harder to analyze due to its non-optimistic nature.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 16

Sharp analysis of linear ensemble sampling

arXiv:2602. 08026v2 Announce Type: replace Abstract: We analyse linear ensemble sampling (ES) with standard Gaussian perturbations in stochastic linear bandits.

By David Janz, Arya Akhavan, Csaba Szepesv\'ari

benchmarks

arXiv Machine Learning

Jun 30

Optimal Regret for Single Index Bandits

arXiv:2605. 09454v2 Announce Type: replace-cross Abstract: We study the $\textit{single-index bandit}$ problem, where rewards depend on an unknown one-dimensional projection of high-dimensional contexts through an unknown reward function.

By Devdan Dey, Sujoy Bhore, Avishek Ghosh

reinforcement-learning

arXiv Machine Learning

Jun 4

When and why randomised exploration works (in linear bandits)

arXiv:2502. 08870v2 Announce Type: replace Abstract: We provide an approach for the analysis of randomised exploration algorithms like Thompson sampling that does not rely on forced optimism or posterior inflation.

By Marc Abeille, David Janz, Ciara Pike-Burke

reinforcement-learning

arXiv Machine Learning

Jul 16

On the Sublinear Regret of Continuous K-Max Bandits

arXiv:2502. 13467v2 Announce Type: replace Abstract: The $K$-Max combinatorial multi-armed bandit problem arises in applications such as recommendation and distributed decision making, where the reward is determined by the maximum outcome among $K$ selected arms.

By Yu Chen, Siwei Wang, Longbo Huang, Wei Chen

reinforcement-learning safety

arXiv Machine Learning

Sep 23

Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits

arXiv:2510.10730v3 Announce Type: replace Abstract: We provide a unified algorithmic framework for ensemble sampling in nonlinear contextual bandits and develop corresponding regret bounds for two mo...

By Jiazheng Sun, Weixin Wang, Pan Xu

reinforcement-learning benchmarks

arXiv Machine Learning

Jun 2

Variance-sensitive Thompson sampling for generalised linear bandits, revisited

arXiv:2606. 00431v1 Announce Type: new Abstract: We prove a variance-sensitive regret bound for Thompson sampling in stochastic generalised linear bandits.

By Tom Perneczky, Marc Abeille, David Janz

One email a morning, machine-written

Related stories

Sharp analysis of linear ensemble sampling

Optimal Regret for Single Index Bandits

When and why randomised exploration works (in linear bandits)

On the Sublinear Regret of Continuous K-Max Bandits

Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits

Variance-sensitive Thompson sampling for generalised linear bandits, revisited