Competitive ratio versus regret minimization: achieving the best of both worlds

by   Amit Daniely, et al.

We consider online algorithms under both the competitive ratio criteria and the regret minimization one. Our main goal is to build a unified methodology that would be able to guarantee both criteria simultaneously. For a general class of online algorithms, namely any Metrical Task System (MTS), we show that one can simultaneously guarantee the best known competitive ratio and a natural regret bound. For the paging problem we further show an efficient online algorithm (polynomial in the number of pages) with this guarantee. To this end, we extend an existing regret minimization algorithm (specifically, Kapralov and Panigrahy) to handle movement cost (the cost of switching between states of the online system). We then show how to use the extended regret minimization algorithm to combine multiple online algorithms. Our end result is an online algorithm that can combine a "base" online algorithm, having a guaranteed competitive ratio, with a range of online algorithms that guarantee a small regret over any interval of time. The combined algorithm guarantees both that the competitive ratio matches that of the base algorithm and a low regret over any time interval. As a by product, we obtain an expert algorithm with close to optimal regret bound on every time interval, even in the presence of switching costs. This result is of independent interest.


Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor

In this paper, we investigate an online prediction strategy named as Dis...

Revisiting Smoothed Online Learning

In this paper, we revisit the problem of smoothed online learning, in wh...

Best of many worlds: Robust model selection for online supervised learning

We introduce algorithms for online, full-information prediction that are...

Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret

We consider the fundamental problem of online control of a linear dynami...

Optimal amortized regret in every interval

Consider the classical problem of predicting the next bit in a sequence ...

An Introduction To Regret Minimization In Algorithmic Trading: A Survey of Universal Portfolio Techniques

In financial investing, universal portfolios are a means of constructing...

Adaptation to Easy Data in Prediction with Limited Advice

We derive an online learning algorithm with improved regret guarantees f...

Please sign up or login with your details

Forgot password? Click here to reset