Aleksander Mądry is an assistant professor in the EECS Department at MIT. His research centers on algorithmic graph theory and understanding uncertainty in the context of optimization. Aleksander received his PhD from MIT in 2011, and prior to joining the MIT faculty, he spent a year as a postdoctoral researcher at Microsoft Research New England, and almost three years on the faculty of EPFL. His work has been recognized with a number of awards, including a NSF CAREER Award, an Alfred P. Sloan Research Fellowship, an ACM Doctoral Dissertation Award Honorable Mention, a George M. Sprowls Doctoral Dissertation Award, and a number of best paper awards at FOCS, SODA, and STOC conferences.
- Foundations of Deep Learning, Summer 2019. Visiting Scientist, Program Organizer and Workshop Organizer.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist, Program Organizer and Workshop Organizer.
- Algorithms and Uncertainty, Fall 2016. Visiting Scientist.
- Algorithmic Spectral Graph Theory, Fall 2014. Visiting Scientist.