Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 2019 | Published
Journal Article Open

An Online Algorithm for Smoothed Online Convex Optimization


We consider Online Convex Optimization (OCO) in the setting where the costs are m-strongly convex and the online learner pays a switching cost for changing decisions between rounds. We show that the recently proposed Online Balanced Descent (OBD) algorithm is constant competitive in this setting, with competitive ratio 3+O(1/m), irrespective of the ambient dimension. We demonstrate the generality of our approach by showing that the OBD framework can be used to construct competitive a algorithm for LQR control.

Additional Information

© 2019 is held by author/owner(s).

Attached Files

Published - p6-goel.pdf


Files (614.7 kB)
Name Size Download all
614.7 kB Preview Download

Additional details

August 19, 2023
August 19, 2023