paper-with-me

Papers

A Communication Efficient Stochastic Multi-Block Alternating Direction Method of Multipliers

2019-12-01 · NeurIPS 2019 12 · Hao Yu

The alternating direction method of multipliers (ADMM) has recently received tremendous interests for distributed large scale optimization in machine learning, statistics, multi-agent networks and related applications. In this paper, we propose a new parallel multi-block stochastic ADMM for distributed stochastic optimization, where each node is only required to perform simple stochastic gradient descent updates. The proposed ADMM is fully parallel, can solve problems with arbitrary block structures, and has a convergence rate comparable to or better than existing state-of-the-art ADMM methods for stochastic optimization. Existing stochastic (or deterministic) ADMMs require each node to exchange its updated primal variables across nodes at each iteration and hence cause significant amount of communication overhead. Existing ADMMs require roughly the same number of inter-node communication rounds as the number of in-node computation rounds. In contrast, the number of communication rounds required by our new ADMM is only the square root of the number of computation rounds.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Stochastic Optimization

Methods 이 논문이 사용한 방법론

ADMM The alternating direction method of multipliers (ADMM) is an algorithm that solves convex optimization problems by breaking them into smaller pieces, each of which are…

Similar Papers 제목 키워드 기반

Trading Computation for Communication: Distributed Stochastic Dual Coordinate Ascent

2013-12-01 · NeurIPS 2013 12 · Tianbao Yang

We present and study a distributed optimization algorithm by employing a stochastic dual coordinate ascent method. Stochastic dual coordinate ascent methods enjoy strong theoretical guarantees and often have better perf…

Distributed Optimization

Neural Network Training via Stochastic Alternating Minimization with Trainable Step Sizes

2025-08-06 · Chengcheng Yan, Jiawei Xu, Zheng Peng, Qingsong Wang arxiv

The training of deep neural networks is inherently a nonconvex optimization problem, yet standard approaches such as stochastic gradient descent (SGD) require simultaneous updates to all parameters, often leading to unst…

A Linearized Alternating Direction Multiplier Method for Federated Matrix Completion Problems

2025-03-17 · Patrick Hytla, Tran T. A. Nghia, Duy Nhat Phan, Andrew Rice

Matrix completion is fundamental for predicting missing data with a wide range of applications in personalized healthcare, e-commerce, recommendation systems, and social network analysis. Traditional matrix completion ap…

Computational EfficiencyFederated LearningMatrix CompletionRecommendation Systems

Fast Stochastic Alternating Direction Method of Multipliers

2013-08-16 · Leon Wenliang Zhong, James T. Kwok

In this paper, we propose a new stochastic alternating direction method of multipliers (ADMM) algorithm, which incrementally approximates the full gradient in the linearized ADMM formulation. Besides having a low per-ite…

Communication-Efficient Stochastic Distributed Learning

2025-01-23 · Xiaoxing Ren, Nicola Bastianello, Karl H. Johansson, Thomas Parisini

We address distributed learning problems, both nonconvex and convex, over undirected networks. In particular, we design a novel algorithm based on the distributed Alternating Direction Method of Multipliers (ADMM) to add…