[HTML][HTML] Optimization algorithms as robust feedback controllers
Mathematical optimization is one of the cornerstones of modern engineering research and
practice. Yet, throughout all application domains, mathematical optimization is, for the most …
practice. Yet, throughout all application domains, mathematical optimization is, for the most …
Time-varying convex optimization: Time-structured algorithms and applications
Optimization underpins many of the challenges that science and technology face on a daily
basis. Recent years have witnessed a major shift from traditional optimization paradigms …
basis. Recent years have witnessed a major shift from traditional optimization paradigms …
Adaptive gradient-based meta-learning methods
We build a theoretical framework for designing and understanding practical meta-learning
methods that integrates sophisticated formalizations of task-similarity with the extensive …
methods that integrates sophisticated formalizations of task-similarity with the extensive …
Stochastic multi-armed-bandit problem with non-stationary rewards
In a multi-armed bandit (MAB) problem a gambler needs to choose at each round of play
one of K arms, each characterized by an unknown reward distribution. Reward realizations …
one of K arms, each characterized by an unknown reward distribution. Reward realizations …
Online distributed algorithms for online noncooperative games with stochastic cost functions: high probability bound of regrets
K Lu - IEEE Transactions on Automatic Control, 2024 - ieeexplore.ieee.org
In this article, online noncooperative games without full decision information are studied,
where the goal of players is to seek the Nash equilibria in a distributed manner. Different …
where the goal of players is to seek the Nash equilibria in a distributed manner. Different …
Distributed online optimization in dynamic environments using mirror descent
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 …
network of agents aim to track the minimizer of a global, time-varying, and convex function …
Adaptive online learning in dynamic environments
In this paper, we study online convex optimization in dynamic environments, and aim to
bound the dynamic regret with respect to any sequence of comparators. Existing work have …
bound the dynamic regret with respect to any sequence of comparators. Existing work have …
An online convex optimization approach to proactive network resource allocation
Existing approaches to online convex optimization make sequential one-slot-ahead
decisions, which lead to (possibly adversarial) losses that drive subsequent decision …
decisions, which lead to (possibly adversarial) losses that drive subsequent decision …
Online optimization in dynamic environments: Improved regret rates for strongly convex problems
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 …
formalize the problem as an instance of online optimization in a dynamic setting. Using …
Learning in repeated auctions with budgets: Regret minimization and equilibrium
In online advertising markets, advertisers often purchase ad placements through bidding in
repeated auctions based on realized viewer information. We study how budget-constrained …
repeated auctions based on realized viewer information. We study how budget-constrained …