According to the main result of the previous post, given any finite action set A with K actions a1,…,aK∈Rd, no matter how an adversary selects the loss vectors y1,…,yn∈Rd, as long as the action losses ⟨ak,yt⟩ are in Continue Reading
In the next few posts we will consider adversarial linear bandits, which, up to a crude first approximation, can be thought of as the adversarial version of stochastic linear bandits. The discussion of the exact nature of the relationship between Continue Reading
In the last two posts we considered stochastic linear bandits, when the actions are vectors in the d-dimensional Euclidean space. According to our previous calculations, under the condition that the expected reward of all the actions are in a fixed Continue Reading
Continuing the previous post, here we give a construction for confidence bounds based on ellipsoidal confidence sets. We also put things together and show bound on the regret of the UCB strategy that uses the constructed confidence bounds. Constructing the Continue Reading
