@inproceedings{b4d07b01afd74aa6877deebe581ece8e,
title = "The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication (Extended Abstract)",
abstract = "We resolve the min-max complexity of distributed stochastic convex optimization (up to a log factor) in the intermittent communication setting, where M machines work in parallel over the course of R rounds of communication to optimize the objective, and during each round of communication, each machine may sequentially compute K stochastic gradient estimates. We present a novel lower bound with a matching upper bound that establishes an optimal algorithm.",
author = "Blake Woodworth and Brian Bullins and Ohad Shamir and Nathan Srebro",
note = "Publisher Copyright: {\textcopyright} 2022 International Joint Conferences on Artificial Intelligence. All rights reserved.; 31st International Joint Conference on Artificial Intelligence, IJCAI 2022 ; Conference date: 23-07-2022 Through 29-07-2022",
year = "2022",
language = "الإنجليزيّة",
series = "IJCAI International Joint Conference on Artificial Intelligence",
pages = "5359--5363",
editor = "{De Raedt}, Luc",
booktitle = "Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022",
}