Export Reviews, Discussions, Author Feedback and Meta-Reviews

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The authors reduce online learning problems (linear regret/bandit, online convex optimization, boosting) into another framework known as drifting games. It is quite related to a similar idea of Rakhlin, Shamir & Sridharan and can be seen as the decrease of some potential mappings (as it is really usual know, see the textbook of Cesa-Bianchi & Lugosi). Those reductions give another interpretation to famous online algorithms (exponential weights, squared potential, etc) and allow to recover their guarantees with new proofs. This is interesting from a theoretical point of view, but I do not see the impact it could have.