Follow the Perturbed Leader for Linear Bandits: Regret over General Action SetsResearch Paper
In an adversarial linear bandit a learner repeatedly picks an action from a set , an adversary picks a reward function, and the learner sees only the reward of the action it played. The problem models online routing, ranking and combinatorial decision making with partial feedback, and its minimax regret over general action sets is …