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. This is also the first result in literature that can combine multiple types of model selection. "The selection of the range": The regret is multiplied by at most a factor of the number of bases Thank you for your comments. B) We would present the full description of the algorithm before Section 4. C) "The assumption that Base algorithms only have access to rewards of rounds when they are selected...": This is not A) "I think it's not trivial to reproduce the results...": We would like more explanations as to why it would We believe we have provided all the details for our experiments. B) "...the instantaneous regret of Step 2 is 1/s times...": Let the cumulative regret of step 1 at round More details are in the proof in Lemma F1, page 24.