[HTML][HTML] Optimization algorithms as robust feedback controllers

A Hauswirth, Z He, S Bolognani, G Hug… - Annual Reviews in Control, 2024 - Elsevier
Mathematical optimization is one of the cornerstones of modern engineering research and
practice. Yet, throughout all application domains, mathematical optimization is, for the most …

Online meta-learning

C Finn, A Rajeswaran, S Kakade… - … on machine learning, 2019 - proceedings.mlr.press
A central capability of intelligent systems is the ability to continuously build upon previous
experiences to speed up and enhance learning of new tasks. Two distinct research …

Incremental learning algorithms and applications

A Gepperth, B Hammer - European symposium on artificial neural …, 2016 - hal.science
Incremental learning refers to learning from streaming data, which arrive over time, with
limited memory resources and, ideally, without sacrificing model accuracy. This setting fits …

Distributed online optimization in dynamic environments using mirror descent

S Shahrampour, A Jadbabaie - IEEE Transactions on Automatic …, 2017 - ieeexplore.ieee.org
This work addresses decentralized online optimization in nonstationary environments. A
network of agents aim to track the minimizer of a global, time-varying, and convex function …

Distributed online convex optimization with time-varying coupled inequality constraints

X Yi, X Li, L **e, KH Johansson - IEEE Transactions on Signal …, 2020 - ieeexplore.ieee.org
This paper considers distributed online optimization with time-varying coupled inequality
constraints. The global objective function is composed of local convex cost and …

An online convex optimization approach to proactive network resource allocation

T Chen, Q Ling, GB Giannakis - IEEE Transactions on Signal …, 2017 - ieeexplore.ieee.org
Existing approaches to online convex optimization make sequential one-slot-ahead
decisions, which lead to (possibly adversarial) losses that drive subsequent decision …

Online optimization in dynamic environments: Improved regret rates for strongly convex problems

A Mokhtari, S Shahrampour… - 2016 IEEE 55th …, 2016 - ieeexplore.ieee.org
In this paper, we address tracking of a time-varying parameter with unknown dynamics. We
formalize the problem as an instance of online optimization in a dynamic setting. Using …

Bandit convex optimization for scalable and dynamic IoT management

T Chen, GB Giannakis - IEEE Internet of Things Journal, 2018 - ieeexplore.ieee.org
This paper deals with online convex optimization involving both time-varying loss functions,
and time-varying constraints. The loss functions are not fully accessible to the learner, and …

Online convex optimization with time-varying constraints and bandit feedback

X Cao, KJR Liu - IEEE Transactions on automatic control, 2018 - ieeexplore.ieee.org
In this paper, online convex optimization problem with time-varying constraints is studied
from the perspective of an agent taking sequential actions. Both the objective function and …

Online learning with inexact proximal online gradient descent algorithms

R Dixit, AS Bedi, R Tripathi… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
We consider nondifferentiable dynamic optimization problems such as those arising in
robotics and subspace tracking. Given the computational constraints and the time-varying …