26 citations · 73 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret
Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett +4
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 s…
cs.LG2015★ 3 cited
Online Convex Optimization Using Predictions
Niangjun Chen, Anish Agarwal, Adam Wierman +2
Making use of predictions is a crucial, but under-explored, area of online algorithms. This paper studies a class of online optimization problems where we have external noisy predi…