Convex Repeated Games and Fenchel Duality

We describe an algorithmic framework for an abstract game which we term a convex repeatedgame. We show that various online learning and boosting algorithms can be all derived as special cases of our algorithmic framework. This unified view explains the properties of existing algorithms and also enables us to derive several new interesting algorithms. Our algorithmic framework stems from a connection that we build between the notions of regret in game theory and weak duality in convex optimization.