Login / Signup

Logarithmic Regret Algorithms for Online Convex Optimization.

Elad HazanAdam KalaiSatyen KaleAmit Agarwal
Published in: COLT (2006)
Keyphrases
  • online convex optimization
  • online learning
  • worst case
  • regret bounds
  • convex optimization
  • long run
  • newton method
  • e learning