🏢 Yandex Research
Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
·1231 words·6 mins·
loading
·
loading
Machine Learning
Optimization
🏢 Yandex Research
First optimal algorithms matching lower bounds for non-smooth convex decentralized optimization over time-varying networks are presented, substantially improving theoretical performance.