Noah Golowich
I am a PhD student at MIT. My research focuses on obtaining provable guarantees to aid our understanding of machine learning algorithms in settings beyond the scope of classical frameworks, such as those involving multiple agents or a dynamic environment. My work includes both upper and lower bounds for the convergence of multi-agent learning algorithms, as well as algorithms with computational and statistical guarantees for learning near-optimal policies in the setting of reinforcement learning. My research interests additionally span learning theory more broadly, including differential privacy and combinatorial problems in learning theory.
I am very fortunate to be advised by Constantinos Daskalakis and Ankur Moitra. I am grateful to be supported by a Hertz Foundation Fellowship and an NSF Graduate Fellowship. I was additionally supported by an MIT Akamai Fellowship in the academic year 2019-2020.
Rahul Ilango and I are organizing the MIT Algorithms and Complexity Seminar. Please email Rahul or me if you would like to give a talk!
I am very fortunate to be advised by Constantinos Daskalakis and Ankur Moitra. I am grateful to be supported by a Hertz Foundation Fellowship and an NSF Graduate Fellowship. I was additionally supported by an MIT Akamai Fellowship in the academic year 2019-2020.
Rahul Ilango and I are organizing the MIT Algorithms and Complexity Seminar. Please email Rahul or me if you would like to give a talk!
Contact information:
n$g at mit dot edu, replace the $ with z
CSAIL
MIT EECS
32 Vassar Street
Cambridge, MA 02139
