Dynamic Regret in Online Convex Optimization with Indicator Switching Costs
Dynamic regret with fixed switching penalties, via a meta-learning framework that is minimax-optimal for piecewise-constant comparators.
Dynamic regret with fixed switching penalties, via a meta-learning framework that is minimax-optimal for piecewise-constant comparators.
A partially lazy gradient descent algorithm for smoothed online learning with switching-cost / regret trade-offs.
Dynamic reinforcement learning for online UAV navigation in evolving environments.
Ph.D. thesis on optimistic online learning with applications to caching networks.
Dynamic-regret analysis of FTRL with optimistic predictions and a history-pruning technique that improves bounds.
Online-learning framework for network slicing supporting AI services.
Monograph on optimistic online learning for communication networks (caching, routing, resource management).
Online learning for UAV search missions in adversarial, non-stationary environments.
Online learning for UAV target search missions in non-stationary environments.
Adaptive-regret online non-stochastic control algorithms with strong guarantees in changing environments.