Logarithmic Regret Algorithms for Online Convex Optimization 4: Logarithmic Regret of Exponentially Weighted Online OptimizationResearch Paper
In online convex optimization a player repeatedly chooses a point from a convex set , after which an adversary reveals a convex cost function and the player pays . The player's regret after rounds is its total cost minus the cost of the best fixed point in hindsight. The model covers online portfolio selection,…