Login / Signup

Dynamic Regret Bounds without Lipschitz Continuity: Online Convex Optimization with Multiple Mirror Descent Steps.

Nima EshraghiBen Liang
Published in: ACC (2022)
Keyphrases
  • online convex optimization
  • regret bounds
  • online learning
  • long run
  • knn
  • convex optimization