problems to be compatible with multiple adversarial bandit algorithms which allows us to obtain previously unattainable

We would like to thank the reviewers for their time. To understand this result, consider k arms of dimension d < k. This is also the first result in literature that can combine multiple types of model selection. Reviewer 1: "The selection of the range": The regret is multiplied by at most a factor of the number of bases M, which In the paper we choose the largest ɛ to be 100, 000 but in practice such a large ɛ is unreasonable. Reviewer 2: Thank you for your comments.