The min-max complexity of distributed stochastic convex optimization with intermittent communication
- Award ID(s):
- 1718970
- NSF-PAR ID:
- 10329069
- Date Published:
- Journal Name:
- Conference on Learning Theory
- Page Range / eLocation ID:
- 4386-4437
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
