Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid communication. We show how applying similar algorithmic transformations can lead to primal and dual block coordinate descent methods that only communicate every s iterations-where s is a tuning parameterinstead of every iteration for the regularized least-squares problem. We derive communicationavoiding variants of the primal and dual block coordinate descent methods which reduce the number of synchronizations by a factor of s on distributed-memory parallel machines without altering the convergence rate. Our communication-avoiding algorithms attain modeled strong scaling speedups of 14× and 165× on a modern supercomputer using MPI and Apache Spark, respectively. Our algorithms attain modeled weak scaling speedups of 12× and 396× on the same machine using MPI and Apache Spark, respectively.
Devarakonda et al. REF derive SA-variants of primal and dual BCD methods for L2 regularized least-squares.
Avoiding communication in primal and dual block coordinate descent methods
ArXiv
ArXiv
Computer Science