Published: 01 Jan 2023, Last Modified: 29 Sept 2023AISTATS 2023Readers: Everyone
Abstract:We consider the problem of universal dynamic regret minimization under exp-concave and smooth losses. We show that appropriately designed Strongly Adaptive algorithms achieve a dynamic regret of $\...