| Implicit regularization in matrix factorization S Gunasekar, BE Woodworth, S Bhojanapalli, B Neyshabur, N Srebro Advances in neural information processing systems 30, 2017 | 581 | 2017 |
| Learning non-discriminatory predictors B Woodworth, S Gunasekar, MI Ohannessian, N Srebro Conference on learning theory, 1920-1953, 2017 | 464 | 2017 |
| Kernel and rich regimes in overparametrized models B Woodworth, S Gunasekar, JD Lee, E Moroshko, P Savarese, I Golan, ... Conference on Learning Theory, 3635-3673, 2020 | 431 | 2020 |
| A field guide to federated optimization J Wang, Z Charles, Z Xu, G Joshi, HB McMahan, M Al-Shedivat, G Andrew, ... arXiv preprint arXiv:2107.06917, 2021 | 419 | 2021 |
| Lower bounds for non-convex stochastic optimization Y Arjevani, Y Carmon, JC Duchi, DJ Foster, N Srebro, B Woodworth Mathematical Programming 199 (1), 165-214, 2023 | 405 | 2023 |
| Is local SGD better than minibatch SGD? B Woodworth, KK Patel, S Stich, Z Dai, B Bullins, B Mcmahan, O Shamir, ... International Conference on Machine Learning, 10334-10343, 2020 | 310 | 2020 |
| Minibatch vs local sgd for heterogeneous distributed learning BE Woodworth, KK Patel, N Srebro Advances in Neural Information Processing Systems 33, 6281-6292, 2020 | 253 | 2020 |
| Tight complexity bounds for optimizing composite objectives BE Woodworth, N Srebro Advances in neural information processing systems 29, 2016 | 236 | 2016 |
| Graph oracle models, lower bounds, and gaps for parallel stochastic optimization BE Woodworth, J Wang, A Smith, B McMahan, N Srebro Advances in neural information processing systems 31, 2018 | 137 | 2018 |
| Training well-generalizing classifiers for fairness metrics and other data-dependent constraints A Cotter, M Gupta, H Jiang, N Srebro, K Sridharan, S Wang, B Woodworth, ... International Conference on Machine Learning, 1397-1405, 2019 | 121 | 2019 |
| Implicit bias in deep linear classification: Initialization scale vs training accuracy E Moroshko, BE Woodworth, S Gunasekar, JD Lee, N Srebro, D Soudry Advances in neural information processing systems 33, 22182-22193, 2020 | 98 | 2020 |
| On the implicit bias of initialization shape: Beyond infinitesimal mirror descent S Azulay, E Moroshko, MS Nacson, BE Woodworth, N Srebro, ... International Conference on Machine Learning, 468-477, 2021 | 90 | 2021 |
| The complexity of making the gradient small in stochastic convex optimization DJ Foster, A Sekhari, O Shamir, N Srebro, K Sridharan, B Woodworth Conference on Learning Theory, 1319-1345, 2019 | 66 | 2019 |
| Asynchronous SGD beats minibatch SGD under arbitrary delays K Mishchenko, F Bach, M Even, BE Woodworth Advances in Neural Information Processing Systems 35, 420-433, 2022 | 64 | 2022 |
| The min-max complexity of distributed stochastic convex optimization with intermittent communication BE Woodworth, B Bullins, O Shamir, N Srebro Conference on Learning Theory, 4386-4437, 2021 | 60 | 2021 |
| Mirrorless mirror descent: A natural derivation of mirror descent S Gunasekar, B Woodworth, N Srebro International Conference on Artificial Intelligence and Statistics, 2305-2313, 2021 | 49* | 2021 |
| Lower bound for randomized first order convex optimization B Woodworth, N Srebro arXiv preprint arXiv:1709.03594, 2017 | 43 | 2017 |
| The gradient complexity of linear regression M Braverman, E Hazan, M Simchowitz, B Woodworth Conference on Learning Theory, 627-647, 2020 | 42 | 2020 |
| An even more optimal stochastic optimization algorithm: minibatching and interpolation learning BE Woodworth, N Srebro Advances in neural information processing systems 34, 7333-7345, 2021 | 32 | 2021 |
| Towards optimal communication complexity in distributed non-convex optimization KK Patel, L Wang, BE Woodworth, B Bullins, N Srebro Advances in Neural Information Processing Systems 35, 13316-13328, 2022 | 23 | 2022 |
Nathan SrebroProfessor, TTIC and University of ChicagoПотвърден имейл адрес: ttic.edu
