# Fast Distributed Coordinate Descent for Non-Strongly Convex Losses

21 May 2014

We propose an efficient distributed randomized coordinate descent method for minimizing regularized non-strongly convex loss functions. The method attains the optimal $O(1/k^2)$ convergence rate, where $k$ is the iteration counter... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now