Trading regret for efficiency: online convex optimization with long term constraints.

Mehrdad Mahdavi Rong Jin Tianbao Yang

Published in: J. Mach. Learn. Res. (2012)

Keyphrases

online convex optimization
long term
online learning
long run
convex optimization
regret bounds
lower bound
cost function
newton method
efficient algorithms for solving
linear constraints
decision trees
optical flow
worst case