Mostly Exploration-Free Algorithms for Contextual Bandits: the greedy algorithm has logarithmic regret for two-armed linear contextual bandits under covariate diversityResearch Paper
In a contextual bandit, a decision maker repeatedly observes the features of an individual (a patient, a customer, a user), chooses one of several actions, and sees the reward of the chosen action only. Applications include personalized medicine, dynamic pricing and ad placement. The standard algorithms (upper-confidence-bound and Thompson-sampling methods,…