ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2211.00533
  4. Cited By
Optimal Complexity in Non-Convex Decentralized Learning over
  Time-Varying Networks

Optimal Complexity in Non-Convex Decentralized Learning over Time-Varying Networks

1 November 2022
Xinmeng Huang
Kun Yuan
ArXivPDFHTML

Papers citing "Optimal Complexity in Non-Convex Decentralized Learning over Time-Varying Networks"

2 / 2 papers shown
Title
BlueFog: Make Decentralized Algorithms Practical for Optimization and
  Deep Learning
BlueFog: Make Decentralized Algorithms Practical for Optimization and Deep Learning
Bicheng Ying
Kun Yuan
Hanbin Hu
Yiming Chen
W. Yin
FedML
31
27
0
08 Nov 2021
DecentLaM: Decentralized Momentum SGD for Large-batch Deep Training
DecentLaM: Decentralized Momentum SGD for Large-batch Deep Training
Kun Yuan
Yiming Chen
Xinmeng Huang
Yingya Zhang
Pan Pan
Yinghui Xu
W. Yin
MoE
46
60
0
24 Apr 2021
1