339 citations · 1k across the 41 of their papers we have counts for
3 papers · 1 filter
Regret Bound by Variation for Online Convex Optimization
Tianbao Yang, Mehrdad Mahdavi, Rong Jin +1
In citep{Hazan-2008-extract}, the authors showed that the regret of online linear optimization can be bounded by the total variation of the cost vectors. In this paper, we extend t…
Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints
Mehrdad Mahdavi, Rong Jin, Tianbao Yang
In this paper we propose a framework for solving constrained online convex optimization problem. Our motivation stems from the observation that most algorithms proposed for online…
Improved Bound for the Nystrom's Method and its Application to Kernel Classification
Rong Jin, Tianbao Yang, Mehrdad Mahdavi +2
We develop two approaches for analyzing the approximation error bound for the Nyström method, one based on the concentration inequality of integral operator, and one based on the c…