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

In this paper, we investigate online convex optimization (OCO) with squared l
2
norm switching cost, which has great applicability but very little work has been done on it. Specifically, we provide a new theoretical analysis in terms of dynamic regret and lower bounds for the case when loss functions are strongly-convex and smooth or only smooth. We show that by applying the advanced Online Multiple Gradient Descent (OMGD) and Online Optimistic Mirror Descent (OOMD) algorithms that are originally proposed for classic OCO, we can achieve state-of-the-art performance bounds for OCO with squared l
2
norm switching cost. Furthermore, we show that these bounds match the lower bound.