Smoothed Online Optimization for Regression and Control [article]

Gautam Goel, Adam Wierman
<span title="2019-04-04">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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. Additionally, we show that when the sequence of cost functions is ϵ-smooth, OBD has near-optimal dynamic regret and maintains
more &raquo; ... rong per-round accuracy. We demonstrate the generality of our approach by showing that the OBD framework can be used to construct competitive algorithms for a variety of online problems across learning and control, including online variants of ridge regression, logistic regression, maximum likelihood estimation, and LQR control.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:1810.10132v2</a> <a target="_blank" rel="external noopener" href="">fatcat:wmglvcrpsff2beqx4cl662hyra</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>