A survey on distributed online optimization and online games

X Li, L **e, N Li - Annual Reviews in Control, 2023 - Elsevier
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 …

On the regret analysis of online LQR control with predictions

R Zhang, Y Li, N Li - 2021 American Control Conference (ACC), 2021 - ieeexplore.ieee.org
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 …

Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit

Y Li, G Qu, N Li - IEEE Transactions on Automatic Control, 2020 - ieeexplore.ieee.org
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 …

Online optimal control with affine constraints

Y Li, S Das, N Li - Proceedings of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
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 …

Regret-optimal control in dynamic environments

G Goel, B Hassibi - arxiv preprint arxiv:2010.10473, 2020 - arxiv.org
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 …

Revisiting smoothed online learning

L Zhang, W Jiang, S Lu, T Yang - Advances in Neural …, 2021 - proceedings.neurips.cc
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 …

Smoothed online optimization with unreliable predictions

D Rutten, N Christianson, D Mukherjee… - Proceedings of the ACM …, 2023 - dl.acm.org
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 …

[PDF][PDF] Online optimization with untrusted predictions

D Rutten, N Christianson… - arxiv preprint arxiv …, 2022 - authors.library.caltech.edu
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 …

Robustified learning for online optimization with memory costs

P Li, J Yang, S Ren - IEEE INFOCOM 2023-IEEE Conference …, 2023 - ieeexplore.ieee.org
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 …

Smoothed online convex optimization based on discounted-normal-predictor

L Zhang, W Jiang, J Yi, T Yang - Advances in Neural …, 2022 - proceedings.neurips.cc
In this paper, we investigate an online prediction strategy named as Discounted-Normal-
Predictor [Kapralov and Panigrahy, 2010] for smoothed online convex optimization (SOCO) …