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.
Dynamic-regret analysis of FTRL with optimistic predictions and a history-pruning technique that improves bounds.
Multi-target path planning with probabilistic detection in cluttered 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.
Federated learning + deep RL for online resource allocation in mobile edge computing.
No-regret algorithms for discrete caching that integrate untrusted predictions for improved performance.
Online caching with optimistic learning, exploiting predictions while keeping no-regret guarantees.
Rational contracts for data-driven service provisioning in blockchain-powered systems.
Reinforcement learning for real-time EV charging/discharging scheduling.