13 citations · 17 across the 4 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2018
Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent
Niangjun Chen, Gautam Goel, Adam Wierman
We study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds. Given a $Ω(\sqrt{d…
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…