CoCoA Is ADMM: Unifying Two Paradigms in Distributed Optimization
This work provides theoretical unification for researchers in distributed optimization, but it is incremental as it connects existing paradigms without introducing new methods.
The paper demonstrates that CoCoA and ADMM, two prominent classes of distributed optimization algorithms, can be unified into a common update form, revealing that CoCoA is a special case of proximal ADMM for solving the dual problem, with simulations and real-world data supporting the findings.
We consider primal-dual algorithms for general empirical risk minimization problems in distributed settings, focusing on two prominent classes of algorithms. The first class is the communication-efficient distributed dual coordinate ascent (CoCoA), derived from the coordinate ascent method for solving the dual problem. The second class is the alternating direction method of multipliers (ADMM), including consensus ADMM, proximal ADMM, and linearized ADMM. We demonstrate that both classes of algorithms can be transformed into a unified update form that involves only primal and dual variables. This discovery reveals key connections between the two classes of algorithms: CoCoA can be interpreted as a special case of proximal ADMM for solving the dual problem, while consensus ADMM is equivalent to a proximal ADMM algorithm. This discovery provides insight into how we can easily enable the ADMM variants to outperform the CoCoA variants by adjusting the augmented Lagrangian parameter. We further explore linearized versions of ADMM and analyze the effects of tuning parameters on these ADMM variants in the distributed setting. Extensive simulation studies and real-world data analysis support our theoretical findings.