Distributed mini-batch random projection algorithms for reduced communication overhead

We propose a gossip-based mini-batch random projection (GMRP) algorithm that can reduce communication overhead for a distributed optimization problem defined over a network with a very large number of constraints. We state a convergence result and provide an application of the GMRP, text classification with support vector machines.