Online Optimization with Gradual Variations [bibtex]
with Chao-Kai Chiang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, Shenghuo Zhu
In COLT 2012. Best Student Paper Award.
This paper is a merged paper of two COLT submissions. Our manuscript proposes two algorithms for online convex optimization
to obtain a variation based regret bound. One of our algorithms is the same to the algorithm proposed in the other submission.
A commmentary on the merged paper written by Satyen Kale can be found here.