Login / Signup

Logarithmic regret algorithms for online convex optimization.

Elad HazanAmit AgarwalSatyen Kale
Published in: Mach. Learn. (2007)
Keyphrases
  • online convex optimization
  • regret bounds
  • online learning
  • worst case
  • long run
  • newton method
  • learning algorithm
  • convex optimization
  • multi class
  • linear programming
  • matrix factorization