Publications by Kun Yuan | EPFL Graph Search

Multiagent Fully Decentralized Value Function Learning With Linear Convergence Rates

Ali H. Sayed, Kun Yuan, Lucas Cesar Eduardo Cassano

This article develops a fully decentralized multiagent algorithm for policy evaluation. The proposed scheme can be applied to two distinct scenarios. In the first scenario, a collection of agents have distinct datasets gathered by following different behav ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Decentralized Proximal Gradient Algorithms With Linear Convergence Rates

Ali H. Sayed, Kun Yuan, Sulaiman A S A E Alghunaim

This article studies a class of nonsmooth decentralized multiagent optimization problems where the agents aim at minimizing a sum of local strongly-convex smooth components plus a common nonsmooth term. We propose a general primal-dual algorithmic framewor ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

On the Influence of Bias-Correction on Distributed Stochastic Optimization

Ali H. Sayed, Bicheng Ying, Kun Yuan, Sulaiman A S A E Alghunaim

Various bias-correction methods such as EXTRA, gradient tracking methods, and exact diffusion have been proposed recently to solve distributed deterministic optimization problems. These methods employ constant step-sizes and converge linearly to the exact ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

A Proximal Diffusion Strategy for Multiagent Optimization With Sparse Affine Constraints

Ali H. Sayed, Kun Yuan, Sulaiman A S A E Alghunaim

This article develops a proximal primal-dual decentralized strategy for multiagent optimization problems that involve multiple coupled affine constraints, where each constraint may involve only a subset of the agents. The constraints are generally sparse, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Variance-Reduced Stochastic Learning Under Random Reshuffling

Ali H. Sayed, Bicheng Ying, Kun Yuan

Several useful variance-reduced stochastic gradient algorithms, such as SVRG, SAGA, Finito, and SAG, have been proposed to minimize empirical risks with linear convergence properties to the exact minimizer. The existing convergence results assume uniform d ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

On the Performance of Exact Diffusion over Adaptive Networks

Ali H. Sayed, Sulaiman A S A E Alghunaim, Bicheng Ying, Kun Yuan

Various bias-correction methods such as EXTRA, DIGing, and exact diffusion have been proposed recently to solve distributed deterministic optimization problems. These methods employ constant step-sizes and converge linearly to the exact solution under prop ...

IEEE2019

Stochastic Learning Under Random Reshuffling With Constant Step-Sizes

Ali H. Sayed, Stefan Vlaski, Bicheng Ying, Kun Yuan

In empirical risk optimization, it has been observed that stochastic gradient implementations that rely on random reshuffling of the data achieve better performance than implementations that rely on sampling the data uniformly. Recent works have pursued ju ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Variance-Reduced Stochastic Learning by Networked Agents Under Random Reshuffling

Ali H. Sayed, Bicheng Ying, Kun Yuan

This paper develops a distributed variance-reduced strategy for a collection of interacting agents that are connected by a graph topology. The resulting diffusion-AVRG (where AVRG stands for "amortized variance-reduced gradient") algorithm is shown to have ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan, Sulaiman A S A E Alghunaim

Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based proximal decent ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019