activity
20212026
most citedImproving the Transient Times for Distributed Stochastic Gradient Methods

5 citations · 6 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LG2026

Achieving Linear Speedup for Composite Federated Learning

Kun Huang, Shi Pu, Karl Henrik Johansson

This paper proposes FedNMap, a normal map-based method for composite federated learning, where the objective consists of a smooth loss and a possibly nonsmooth regularizer. FedNMap…

math.OC2025

Distributed Stochastic Momentum Tracking with Local Updates: Achieving Optimal Communication Complexities

Kun Huang, Shi Pu

We propose Local Momentum Tracking (LMT), a novel distributed stochastic gradient method for solving distributed optimization problems over networks. To reduce communication overhe…

math.OC2025

Decentralized Min-Max Optimization with Gradient Tracking

Runze You, Kun Huang, Shi Pu

This paper presents a novel distributed formulation of the min-max optimization problem. Such a formulation enables enhanced flexibility among agents when optimizing their maximiza…

math.OC2024

Distributed Normal Map-based Stochastic Proximal Gradient Methods over Networks

Kun Huang, Shi Pu, Angelia Nedić

Consider agents connected over a network collaborating to minimize the average of their local cost functions combined with a common nonsmooth function. This paper introduces a…

math.OC2024★ 1 cited

An Accelerated Distributed Stochastic Gradient Method with Momentum

Kun Huang, Shi Pu, Angelia Nedić

In this paper, we introduce an accelerated distributed stochastic gradient method with momentum for solving the distributed optimization problem, where a group of agents collab…

math.OC2021★ 5 cited

Improving the Transient Times for Distributed Stochastic Gradient Methods

Kun Huang, Shi Pu

We consider the distributed optimization problem where agents each possessing a local cost function, collaboratively minimize the average of the cost functions over a conne…