Delayed Feedback in Kernel Bandits
Sattar Vakili, Danyal Ahmed, Alberto Bernacchia, Ciara Pike-Burke

TL;DR
This paper addresses kernel bandit optimization with delayed feedback, proposing an algorithm that improves regret bounds and is validated through simulations, extending applicability to real-world scenarios with feedback delays.
Contribution
It introduces a novel algorithm for kernel bandits with stochastic delays, achieving improved regret bounds over previous methods.
Findings
Achieves regret of $ ilde{O}( oot{T} ext{Γ}_k(T)+ ext{E}[ au])$, better than prior work.
Provides theoretical analysis and simulations validating the improved regret bounds.
Extends kernel bandit optimization to settings with delayed feedback, relevant for practical applications.
Abstract
Black box optimisation of an unknown function from expensive and noisy evaluations is a ubiquitous problem in machine learning, academic research and industrial production. An abstraction of the problem can be formulated as a kernel based bandit problem (also known as Bayesian optimisation), where a learner aims at optimising a kernelized function through sequential noisy observations. The existing work predominantly assumes feedback is immediately available; an assumption which fails in many real world situations, including recommendation systems, clinical trials and hyperparameter tuning. We consider a kernel bandit problem under stochastically delayed feedback, and propose an algorithm with regret, where is the number of time steps, is the maximum information gain of the kernel with observations, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Machine Learning and Algorithms · Machine Learning and Data Classification
