Survey Bandits with Regret Guarantees
We consider a variant of the contextual bandit problem. In standard contextual bandits, when a user arrives we get the user's complete feature vector and then assign a treatment (arm) to that user. In a number of applications (like healthcare), collecting features from users can be costly. To address this issue, we propose algorithms that avoid needless feature collection while maintaining strong regret guarantees.
Code (0)
등록된 구현이 없습니다.
Tasks
Multi-Armed BanditsSurveySimilar Papers 제목 키워드 기반
One Arrow, Two Kills: An Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits
We address the problem of \emph{`Internal Regret'} in \emph{Sleeping Bandits} in the fully adversarial setup, as well as draw connections between different existing notions of sleeping regrets in the multiarmed bandits (…
A Survey on Contextual Multi-armed Bandits
In this survey we cover a few stochastic and adversarial contextual bandit algorithms. We analyze each algorithm's assumption and regret bound.
Multi-Armed BanditsSurveyRegret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits
I analyse the frequentist regret of the famous Gittins index strategy for multi-armed bandits with Gaussian noise and a finite horizon. Remarkably it turns out that this approach leads to finite-time regret guarantees co…
Multi-Armed BanditsThompson SamplingContextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces
Designing efficient general-purpose contextual bandit algorithms that work with large -- or even continuous -- action spaces would facilitate application to important scenarios such as information retrieval, recommendati…
continuous-controlContinuous ControlInformation RetrievalMulti-Armed Bandits+2Conformal Bandits: Bringing statistical validity and reward efficiency to the small-gap regime
We introduce Conformal Bandits, a novel framework integrating Conformal Prediction (CP) into bandit problems, a classic paradigm for sequential decision-making under uncertainty. Traditional regret-minimisation bandit st…