Logarithmic Regret Algorithms for Online Convex Optimization 1: Logarithmic Regret of Online Gradient DescentResearch Paper
Online convex optimization is a repeated game between a learner and an adversary. In each round the learner commits to a point of a convex set ; only then is a convex cost function revealed, and the learner pays . The learner is judged by its regret: its total cost minus the total cost of the best…