39 citations · 46 across the 2 of their papers we have counts for
2 papers
cs.LG2015★ 7 cited
Stochastic subGradient Methods with Linear Convergence for Polyhedral Convex Optimization
Tianbao Yang, Qihang Lin
In this paper, we show that simple {Stochastic} subGradient Decent methods with multiple Restarting, named {\bf RSGD}, can achieve a \textit{linear convergence rate} for a class of…
math.OC2015★ 39 cited
Distributed Stochastic Variance Reduced Gradient Methods and A Lower Bound for Communication Complexity
Jason D. Lee, Qihang Lin, Tengyu Ma +1
We study distributed optimization algorithms for minimizing the average of convex functions. The applications include empirical risk minimization problems in statistical machine le…