Dynamic Regret

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.

avatar
Naram Mhaisen
•
On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning featured image

On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning

Dynamic-regret analysis of FTRL with optimistic predictions and a history-pruning technique that improves bounds.

avatar
Naram Mhaisen
•