BriefGPT.xyz
Feb, 2021
分布式随机凸优化的极小-极大复杂度及间歇通信
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
HTML
PDF
Blake Woodworth, Brian Bullins, Ohad Shamir, Nathan Srebro
TL;DR
研究分布式随机凸优化的最小最大复杂度，在间歇通信设置下提出了一种新的下限和上限算法，以确定最佳算法。
Abstract
We resolve the min-max complexity of
distributed stochastic convex optimization
(up to a log factor) in the
intermittent communication
setting, where $M$
→