Suivre
Noah Golowich
Noah Golowich
MIT
Adresse e-mail validée de mit.edu - Page d'accueil
Titre
Citée par
Citée par
Année
Size-independent sample complexity of neural networks
N Golowich, A Rakhlin, O Shamir
Conference On Learning Theory, 297-299, 2018
6712018
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
3112018
Independent policy gradient methods for competitive reinforcement learning
C Daskalakis, DJ Foster, N Golowich
Advances in neural information processing systems 33, 5527-5540, 2020
2122020
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
1852021
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
1272020
Near-optimal no-regret learning in general games
C Daskalakis, M Fishelson, N Golowich
Advances in Neural Information Processing Systems 34, 27604-27616, 2021
1252021
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
1102020
On the power of multiple anonymous messages: Frequency estimation and selection in the shuffle model of differential privacy
B Ghazi, N Golowich, R Kumar, R Pagh, A Velingker
Annual International Conference on the Theory and Applications of …, 2021
1052021
Deep Learning for Multi-Facility Location Mechanism Design.
N Golowich, H Narasimhan, DC Parkes
IJCAI, 261-267, 2018
992018
The complexity of markov equilibrium in stochastic games
C Daskalakis, N Golowich, K Zhang
The Thirty Sixth Annual Conference on Learning Theory, 4180-4234, 2023
842023
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
772022
Smoothed online learning is as easy as statistical learning
A Block, Y Dagan, N Golowich, A Rakhlin
Conference on Learning Theory, 1716-1786, 2022
532022
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
522020
Planning and learning in partially observable systems via filter stability
N Golowich, A Moitra, D Rohatgi
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 349-362, 2023
45*2023
Learning in observable pomdps, without computationally intractable oracles
N Golowich, A Moitra, D Rohatgi
Advances in neural information processing systems 35, 1458-1473, 2022
442022
Tight guarantees for interactive decision making with the decision-estimation coefficient
DJ Foster, N Golowich, Y Han
The Thirty Sixth Annual Conference on Learning Theory, 3969-4043, 2023
432023
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
352021
Model-free reinforcement learning with the decision-estimation coefficient
DJ Foster, N Golowich, J Qian, A Rakhlin, A Sekhari
Advances in Neural Information Processing Systems 36, 20080-20117, 2023
27*2023
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
252022
From external to swap regret 2.0: An efficient reduction for large action spaces
Y Dagan, C Daskalakis, M Fishelson, N Golowich
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1216-1222, 2024
192024
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20