arXiv Statistics ML
Block Optimism for Nonstationary Bandits with Latent Linear Dynamics
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Aug 18
Generalized Linear Bandits with Memory
arXiv:2608. 15848v1 Announce Type: cross Abstract: We study generalized linear bandits with memory, an endogenous non-stationary setting in which rewards depend on past actions through a finite memory matrix.
arXiv Machine Learning
Jul 7
Dynamic Regret for Non-Stationary Linear Bandits via Misspecification Reductions
arXiv:2607. 02891v1 Announce Type: new Abstract: Many online decision-making problems involve both round-specific feasible actions and drifting reward models: eligible ad impressions, feasible prices, and available treatments can change over time, while user preferences, demand curves, and patient responses may evolve.
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.
arXiv Machine Learning
Aug 4
A Perturbation Approach to Unconstrained Linear Bandits
arXiv:2603. 28201v3 Announce Type: replace Abstract: We revisit the standard perturbation-based approach of Abernethy et al.
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.