Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2002.03273
Cited By
On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions
9 February 2020
Yossi Arjevani
Amit Daniely
Stefanie Jegelka
Hongzhou Lin
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions"
2 / 2 papers shown
Non-Convex Federated Optimization under Cost-Aware Client Selection
Xiaowen Jiang
Anton Rodomanov
Sebastian U. Stich
FedML
324
0
0
05 Dec 2025
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
Annual Conference Computational Learning Theory (COLT), 2021
Blake E. Woodworth
Brian Bullins
Ohad Shamir
Nathan Srebro
348
49
0
02 Feb 2021
1
Page 1 of 1
