Login / Signup
Dynamic Regret Bounds without Lipschitz Continuity: Online Convex Optimization with Multiple Mirror Descent Steps.
Nima Eshraghi
Ben Liang
Published in:
ACC (2022)
Keyphrases
</>
online convex optimization
regret bounds
online learning
long run
knn
convex optimization