Efficient Online Convex Optimization with Adaptively Minimax Optimal Dynamic Regret.

Hakan Gökcesu Suleyman Serdar Kozat

Published in: CoRR (2019)

Keyphrases

online convex optimization
worst case
regret bounds
online learning
long run
minimax regret
lower bound
np hard
knn
least squares
sufficient conditions