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.