Aleksander Madry
 | The topic of this article may not meet Wikitia's general notability guideline. |
Aleksander Madry | |
|---|---|
| Add a Photo | |
| Alma mater | University of Wroclaw |
| Occupation |
|
Aleksander Madry is a Polish computer science professor at the Massachusetts Institute of Technology (MIT) who conducts research in the fields of algorithms, optimization, and machine learning.
He is the Cadence Design Systems Professor of Computing in the MIT Electrical Engineering and Computer Science Department[1], a principal investigator at the Computer Science and Artificial Intelligence Laboratory and director of the MIT Center for Deployable Machine Learning[2].
His work spans machine learning, optimization and graph theory, with an emphasis on operationalizing techniques that allow machine learning algorithms to be safely deployed in the real world. One of the main focuses of his work is developing robust and efficient algorithms that can handle adversarial attacks. This strand of research led to development of a method for making neural nets more robust against adversarial attacks and dissecting the roots of widespread presence of adversarial examples[3]. He has also worked on continuous optimization-based approaches to solving combinatorial optimization problems, such as the maximum flow problem[4] and the bipartite matching problem[5].
Mądry received his undergraduate degrees in computer science and physics from the University of Wroclaw in 2006 and 2007, respectively. He then went on to pursue his PhD in computer science at MIT, which he completed in 2011. His dissertation on "From Graphs to Matrices, and Back: New Techniques for Graph Algorithms" was awarded the ACM Doctoral Dissertation Award Honorable Mention and MIT’s George M. Sprowls Award for best thesis in computer science. He was then a postdoc at Microsoft Research New England and on the faculty of EPFL in Switzerland, before joining the faculty at MIT EECS.
His papers have received roughly 20,000 citations, with an h-index of 40[6]. He has also received numerous awards and honors for his research contributions, including an NSF Career Award[7]. His work has been awarded several best paper awards from conferences such as the IEEE Symposium on Foundations of Computer Science (FOCS)[8]. In 2019, he was awarded the Presburger Award by the European Association for Theoretical Computer Science[9].
References
- ↑ "MIT Schwarzman College of Computing awards named professorships to two faculty members". Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "Aleksander Madry". Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "Adversarial Examples Are Not Bugs, They Are Features" (PDF). Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs". Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "Navigating Central Path with Electrical Flows: from Flows to Matchings, and Back". Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "Aleksandry Madry Google Citations". Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "NSF Career Award". Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "Aleksander Madry Receives Best Paper Award at FOCS". Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link) - ↑ "The Presburger Award 2018 - Laudatio for Aleksander Madry" (PDF). Retrieved 2023-03-13.
{{cite web}}: CS1 maint: url-status (link)
External links
This article "Aleksander Madry" is from Wikipedia. The list of its authors can be seen in its historical. Articles taken from Draft Namespace on Wikipedia could be accessed on Wikipedia's Draft Namespace.