Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent
[edit]
Proceedings of the 31st Conference On Learning Theory, PMLR 75:15741594, 2018.
Abstract
We study \emph{smoothed online convex optimization}, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a $\Omega(\sqrt{d})$ lower bound on the competitive ratio of any online algorithm, where $d$ is the dimension of the action space, we ask under what conditions this bound can be beaten. We introduce a novel algorithmic framework for this problem, Online Balanced Descent (OBD), which works by iteratively projecting the previous point onto a carefully chosen level set of the current cost function so as to balance the switching costs and hitting costs. We demonstrate the generality of the OBD framework by showing how, with different choices of “balance,” OBD can improve upon stateoftheart performance guarantees for both competitive ratio and regret; in particular, OBD is the first algorithm to achieve a dimensionfree competitive ratio, $3 + O(1/\alpha)$, for locally polyhedral costs, where $\alpha$ measures the “steepness” of the costs. We also prove bounds on the dynamic regret of OBD when the balance is performed in the dual space that are dimensionfree and imply that OBD has sublinear static regret.
Related Material


