activity
20082026
most citedOn the Linear Convergence of the ADMM in Decentralized Consensus Optimization

873 citations · 5.4k across the 120 of their papers we have counts for

collaborators
Showing cs.LGShow all

31 papers · 1 filter

cs.LG2023

DSGD-CECA: Decentralized SGD with Communication-Optimal Exact Consensus Algorithm

Lisang Ding, Kexin Jin, Bicheng Ying +2

Decentralized Stochastic Gradient Descent (SGD) is an emerging neural network training approach that enables multiple agents to train a model collaboratively and simultaneously. Ra…

cs.LG2023★ 1 cited

Towards Constituting Mathematical Structures for Learning to Optimize

Jialin Liu, Xiaohan Chen, Zhangyang Wang +2

Learning to Optimize (L2O), a technique that utilizes machine learning to learn an optimization algorithm automatically from data, has gained arising attention in recent years. A g…

cs.LG2023

Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression

Yutong He, Xinmeng Huang, Yiming Chen +2

Communication compression is an essential strategy for alleviating communication overhead by reducing the volume of information exchanged between computing nodes in large-scale dis…

cs.LG2022★ 30 cited

An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methods

Yanli Liu, Kaiqing Zhang, Tamer Başar +1

In this paper, we revisit and improve the convergence of policy gradient (PG), natural PG (NPG) methods, and their variance-reduced variants, under general smooth policy parametriz…

cs.LG2022

Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization

Quan Xiao, Han Shen, Wotao Yin +1

Stochastic bilevel optimization, which captures the inherent nested structure of machine learning problems, is gaining popularity in many recent applications. Existing works on bil…

cs.LG2022★ 6 cited

On Representing Mixed-Integer Linear Programs by Graph Neural Networks

Ziang Chen, Jialin Liu, Xinshang Wang +2

While Mixed-integer linear programming (MILP) is NP-hard in general, practical MILP has received roughly 100--fold speedup in the past twenty years. Still, many classes of MILPs qu…