Cover Image

When and why randomised exploration works (in linear bandits)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abeille, Marc, Janz, David, Pike-Burke, Ciara
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Variance-sensitive Thompson sampling for generalised linear bandits, revisited
by: Perneczky, Tom, et al.
Published: (2026)

Ensemble sampling for linear bandits: small ensembles suffice
by: Janz, David, et al.
Published: (2023)

Fixed-Confidence Multiple Change Point Identification under Bandit Feedback
by: Lazzaro, Joseph, et al.
Published: (2025)

Fixed-Budget Change Point Identification in Piecewise Constant Bandits
by: Lazzaro, Joseph, et al.
Published: (2025)

Locally Differentially Private Thresholding Bandits
by: Barbara, Annalisa, et al.
Published: (2025)

QuACK: A Multipurpose Queuing Algorithm for Cooperative $k$-Armed Bandits
by: Howson, Benjamin, et al.
Published: (2024)

Learning Fair And Effective Points-Based Rewards Programs
by: Hssaine, Chamsi, et al.
Published: (2025)

Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity
by: Johnson, Emmeran, et al.
Published: (2023)

On the necessity of adaptive regularisation:Optimal anytime online learning on $\boldsymbol{\ell_p}$-balls
by: Johnson, Emmeran, et al.
Published: (2025)

Stochastic Shortest Path with Sparse Adversarial Costs
by: Johnson, Emmeran, et al.
Published: (2025)

Efficient kernelized bandit algorithms via exploration distributions
by: Hu, Bingshan, et al.
Published: (2025)

Efficient learning by implicit exploration in bandit problems with side observations
by: Kocak, Tomas, et al.
Published: (2026)

On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025)

Sharp analysis of linear ensemble sampling
by: Akhavan, Arya, et al.
Published: (2026)

Adversarial bandit optimization for approximately linear functions
by: Cheng, Zhuoyu, et al.
Published: (2025)

On the Hardness of Reinforcement Learning with Transition Look-Ahead
by: Pla, Corentin, et al.
Published: (2025)

Best-of-Both Worlds for linear contextual bandits with paid observations
by: Boyer, Nathan, et al.
Published: (2025)

Exploration via linearly perturbed loss minimisation
by: Janz, David, et al.
Published: (2023)

Extreme bandits
by: Carpentier, Alexandra, et al.
Published: (2026)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

Truthful mechanisms for linear bandit games with private contexts
by: Hu, Yiting, et al.
Published: (2025)

Precision autotuning for linear solvers via contextual bandit-based RL
by: Carson, Erin, et al.
Published: (2026)

Spectral bandits
by: Kocák, Tomáš, et al.
Published: (2026)

Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)

Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)

Spectral bandits for smooth graph functions
by: Valko, Michal, et al.
Published: (2026)

Approximate information maximization for bandit games
by: Barbier-Chebbah, Alex, et al.
Published: (2023)

Online learning in bandits with predicted context
by: Guo, Yongyi, et al.
Published: (2023)

Risk and optimal policies in bandit experiments
by: Adusumilli, Karun
Published: (2021)

Offline-to-online hyperparameter transfer for stochastic bandits
by: Sharma, Dravyansh, et al.
Published: (2025)

Revealing graph bandits for maximizing local influence
by: Carpentier, Alexandra, et al.
Published: (2026)

Linear bandits with polylogarithmic minimax regret
by: Lumbreras, Josep, et al.
Published: (2024)

Leveraging priors on distribution functions for multi-arm bandits
by: Vashishtha, Sumit, et al.
Published: (2025)

Lookahead identification in adversarial bandits: accuracy and memory bounds
by: Brukhim, Nataly, et al.
Published: (2026)

Trading off rewards and errors in multi-armed bandits
by: Erraqabi, Akram, et al.
Published: (2026)

Minimum mean-squared error estimation with bandit feedback
by: Ghosh, Ayon, et al.
Published: (2022)

VITS : Variational Inference Thompson Sampling for contextual bandits
by: Clavier, Pierre, et al.
Published: (2023)

Model selection for behavioral learning data and applications to contextual bandits
by: Aubert, Julien, et al.
Published: (2025)

Spectral bandits for smooth graph functions with applications in recommender systems
by: Kocák, Tomáš, et al.
Published: (2026)

Optimal cross-learning for contextual bandits with unknown context distributions
by: Schneider, Jon, et al.
Published: (2024)