arXiv Machine Learning
Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 15
Linear Ensemble Sampling with Smaller Ensembles
arXiv:2609. 13954v1 Announce Type: new Abstract: Ensemble sampling offers a practical approach to randomized exploration by maintaining a collection of models, but how small an ensemble can be while retaining strong regret guarantees remains unresolved.
arXiv Machine Learning
Jul 1
Contextual Slate GLM Bandits with Limited Adaptivity
arXiv:2606. 31449v1 Announce Type: new Abstract: We investigate the contextual slate bandit problem with generalized linear rewards under limited adaptivity.
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.
arXiv Machine Learning
Jun 30
Randomized Exploration for Linear Bandits via Absolute Perturbations
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.
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.
arXiv Machine Learning
Jun 10
Replicable Bandits with UCB based Exploration
arXiv:2604. 20024v2 Announce Type: replace Abstract: We study replicable algorithms for stochastic multi-armed bandits (MAB) and linear bandits with UCB (Upper Confidence Bound) based exploration.