Logarithmic regret algorithms for online convex optimization

In an online convex optimization problem a decision- maker makes a sequence of decisions, i. e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After each point is chosen, it encounters a sequence of ( possibly unrelated) convex cost functions. Zinkevich ( ICML 2003) introduced this framework, which models many natural repeated decision- making problems and generalizes many existing problems such as Prediction from Expert Advice and Cover's Universal Portfolios. Zinkevich showed that a simple online gradient descent algorithm achieves additive regret O(root T), for an arbitrary sequence of T convex cost functions ( of bounded gradients), with respect to the best single decision in hindsight. In this paper, we give algorithms that achieve regret O( log( T)) for an arbitrary sequence of strictly convex functions ( with bounded first and second derivatives). This mirrors what has been done for the special cases of prediction from expert advice by Kivinen and Warmuth ( EuroCOLT 1999), and Universal Portfolios by Cover ( Math. Finance 1: 1 - 19, 1991). We propose several algorithms achieving logarithmic regret, which besides being more general are also much more efficient to implement. The main new ideas give rise to an efficient algorithm based on the Newton method for optimization, a new tool in the field. Our analysis shows a surprising connection between the natural follow-the- leader approach and the Newton method. We also analyze other algorithms, which tie together several different previous approaches including follow-the- leader, exponential weighting, Cover's algorithm and gradient descent.