activity
20182025
most citedStructure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families

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

collaborators
Showing cs.DCShow all

1 paper · 1 filter

cs.DC2023

Decentralized Local Updates with Dual-Slow Estimation and Momentum-based Variance-Reduction for Non-Convex Optimization

Kangyang Luo, Kunkun Zhang, Shengbo Zhang +2

Decentralized learning (DL) has recently employed local updates to reduce the communication cost for general non-convex optimization problems. Specifically, local updates require e…