Optimal Dynamic Regret for Online Convex Optimization with Squared l2 Norm Switching Cost.

Qingsong Liu Yaoyu Zhang

Published in: ACC (2022)

Keyphrases

online convex optimization
regret bounds
online learning
worst case
convex optimization
newton method
long run
optimal solution
dynamic programming
cost sensitive
regularized least squares
lower bound
least squares
multi class
optimization problems
closed form