A survey on distributed online optimization and online games
Distributed online optimization and online games have been increasingly researched in the
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …
On the regret analysis of online LQR control with predictions
In this paper, we study the dynamic regret of online linear quadratic regulator (LQR) control
with time-varying cost functions and disturbances. We consider the case where a finite look …
with time-varying cost functions and disturbances. We consider the case where a finite look …
Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit
This article considers online optimization with a finite prediction window of cost functions
and additional switching costs on the decisions. We study the fundamental limits of dynamic …
and additional switching costs on the decisions. We study the fundamental limits of dynamic …
Online optimal control with affine constraints
This paper considers online optimal control with affine constraints on the states and actions
under linear dynamics with bounded random disturbances. The system dynamics and …
under linear dynamics with bounded random disturbances. The system dynamics and …
Regret-optimal control in dynamic environments
We consider control in linear time-varying dynamical systems from the perspective of regret
minimization. Unlike most prior work in this area, we focus on the problem of designing an …
minimization. Unlike most prior work in this area, we focus on the problem of designing an …
Revisiting smoothed online learning
In this paper, we revisit the problem of smoothed online learning, in which the online learner
suffers both a hitting cost and a switching cost, and target two performance metrics …
suffers both a hitting cost and a switching cost, and target two performance metrics …
Smoothed online optimization with unreliable predictions
We examine the problem of smoothed online optimization, where a decision maker must
sequentially choose points in a normed vector space to minimize the sum of per-round, non …
sequentially choose points in a normed vector space to minimize the sum of per-round, non …
[PDF][PDF] Online optimization with untrusted predictions
We examine the problem of online optimization, where a decision maker must sequentially
choose points in a general metric space to minimize the sum of per-round, non-convex …
choose points in a general metric space to minimize the sum of per-round, non-convex …
Robustified learning for online optimization with memory costs
Online optimization with memory costs has many real-world applications, where sequential
actions are made without knowing the future input. Nonetheless, the memory cost couples …
actions are made without knowing the future input. Nonetheless, the memory cost couples …
Smoothed online convex optimization based on discounted-normal-predictor
In this paper, we investigate an online prediction strategy named as Discounted-Normal-
Predictor [Kapralov and Panigrahy, 2010] for smoothed online convex optimization (SOCO) …
Predictor [Kapralov and Panigrahy, 2010] for smoothed online convex optimization (SOCO) …