| Size-independent sample complexity of neural networks N Golowich, A Rakhlin, O Shamir Conference On Learning Theory, 297-299, 2018 | 399 | 2018 |
| A convergence analysis of gradient descent for deep linear neural networks S Arora, N Cohen, N Golowich, W Hu arXiv preprint arXiv:1810.02281, 2018 | 191 | 2018 |
| Independent policy gradient methods for competitive reinforcement learning C Daskalakis, DJ Foster, N Golowich Advances in neural information processing systems 33, 5527-5540, 2020 | 94 | 2020 |
| Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems N Golowich, S Pattathil, C Daskalakis, A Ozdaglar Conference on Learning Theory, 1758-1784, 2020 | 74 | 2020 |
| Deep Learning for Multi-Facility Location Mechanism Design. N Golowich, H Narasimhan, DC Parkes IJCAI, 261-267, 2018 | 61 | 2018 |
| On the power of multiple anonymous messages B Ghazi, N Golowich, R Kumar, R Pagh, A Velingker arXiv preprint arXiv:1908.11358, 2019 | 58* | 2019 |
| Deep learning with label differential privacy B Ghazi, N Golowich, R Kumar, P Manurangsi, C Zhang Advances in neural information processing systems 34, 27131-27145, 2021 | 42 | 2021 |
| Tight last-iterate convergence rates for no-regret learning in multi-player games N Golowich, S Pattathil, C Daskalakis 34th Conference on Neural Information Processing Systems (NeurIPS 2020), 2020 | 42 | 2020 |
| Pure differentially private summation from anonymous messages B Ghazi, N Golowich, R Kumar, P Manurangsi, R Pagh, A Velingker arXiv preprint arXiv:2002.01919, 2020 | 38 | 2020 |
| Near-optimal no-regret learning in general games C Daskalakis, M Fishelson, N Golowich Advances in Neural Information Processing Systems 34, 27604-27616, 2021 | 33 | 2021 |
| Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games I Anagnostides, C Daskalakis, G Farina, M Fishelson, N Golowich, ... Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 20 | 2022 |
| The complexity of markov equilibrium in stochastic games C Daskalakis, N Golowich, K Zhang arXiv preprint arXiv:2204.03991, 2022 | 17 | 2022 |
| Sample-efficient proper PAC learning with approximate differential privacy B Ghazi, N Golowich, R Kumar, P Manurangsi Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 13 | 2021 |
| Planning in observable POMDPs in quasipolynomial time N Golowich, A Moitra, D Rohatgi arXiv preprint arXiv:2201.04735, 2022 | 12 | 2022 |
| Communication-rounds tradeoffs for common randomness and secret key generation M Bafna, B Ghazi, N Golowich, M Sudan Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 9 | 2019 |
| Smoothed online learning is as easy as statistical learning A Block, Y Dagan, N Golowich, A Rakhlin Conference on Learning Theory, 1716-1786, 2022 | 8 | 2022 |
| Fast rates for nonparametric online learning: from realizability to learning in games C Daskalakis, N Golowich Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 8 | 2022 |
| Resolving a conjecture on degree of regularity of linear homogeneous equations N Golowich arXiv preprint arXiv:1404.3384, 2014 | 8 | 2014 |
| Acyclic subgraphs of planar digraphs N Golowich, D Rolnick arXiv preprint arXiv:1407.8045, 2014 | 7 | 2014 |
| The m-degenerate chromatic number of a digraph N Golowich Discrete Mathematics 339 (6), 1734-1743, 2016 | 6* | 2016 |
Constantinos DaskalakisProfessor of Computer Science, MITVerified email at csail.mit.edu
