A tale of two metrics: simultaneous bounds on competitiveness and regret

SIGMETRICS, 2013.

Cited by: 64|Views53
EI

Abstract:

We consider algorithms for "smoothed online convex optimization" problems, a variant of the class of online convex optimization problems that is strongly related to metrical task systems. Prior literature on these problems has focused on two performance metrics: regret and the competitive ratio. There exist known algorithms with subline...More

Code:

Data:

Your rating :
0

 

Tags
Comments