暂无评分数据
ICLR 2025
Achieving Optimal Complexity in Decentralized Learning over Row-Stochastic Networks
TL;DR
We investigate lower bound and propose novel algorithms to match our lower bound in Row-Only decentralized learning.
摘要
关键词
decentralized stochastic optimizationdirected graphrow-stochastic matrixgradient tracking
评审与讨论
作者撤稿通知
We realized some fundemantal problems in the proposed algorithm and this method will be improved in the future.