Parallel Coordinate Descent Newton Method for Efficient $L_{1}$ -Regularized Loss Minimization

Abstract

The recent years have witnessed advances in parallel algorithms for large scale optimization problems. Notwithstanding the demonstrated success, existing algorithms that parallelize over features are usually limited by divergence issues under high parallelism or require data preprocessing to alleviate these problems. In this work, we propose a Parallel Coordinate Descent algorithm using approximate Newton steps (PCDN) that is guaranteed to converge globally without data preprocessing. The key component of the PCDN algorithm is the high-dimensional line search, which guarantees the global convergence with high parallelism. The PCDN algorithm randomly partitions the feature set into b subsets/bundles of size P , and sequentially processes each bundle by first computing the descent directions for each feature in parallel and then conducting P -dimensional line search to compute the step size. We show that (i) the PCDN algorithm is guaranteed to converge globally despite increasing parallelism; (ii) the PCDN algorithm converges to the specified accuracy within the limited iteration number of T , and T decreases with increasing parallelism. In addition, the data transfer and synchronization cost of the P -dimensional line search can be minimized by maintaining intermediate quantities. For concreteness, the proposed PCDN algorithm is applied to L 1 -regularized logistic regression and L 1 -regularized L 2 -loss SVM problems. Experimental evaluations on seven benchmark datasets show that the proposed PCDN algorithm exploits parallelism well and outperforms the state-of-the-art methods. * Source code is available at https