| Submission declined on 16 July 2024 by PARAKANYAA (talk). This submission's references do not show that the subject qualifies for a Wikipedia article—that is, they do not show significant coverage (not just passing mentions) about the subject in published, reliable, secondary sources that are independent of the subject (see the guidelines on the notability of people). Before any resubmission, additional references meeting these criteria should be added (see technical help and learn about mistakes to avoid when addressing this issue). If no additional references exist, the subject is not suitable for Wikipedia.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
|  |
| Submission declined on 25 April 2024 by Utopes (talk). This submission's references do not show that the subject qualifies for a Wikipedia article—that is, they do not show significant coverage (not just passing mentions) about the subject in published, reliable, secondary sources that are independent of the subject (see the guidelines on the notability of people). Before any resubmission, additional references meeting these criteria should be added (see technical help and learn about mistakes to avoid when addressing this issue). If no additional references exist, the subject is not suitable for Wikipedia. Declined by Utopes 7 months ago. | |
| Submission declined on 4 March 2024 by GSS (talk). This submission's references do not show that the subject qualifies for a Wikipedia article—that is, they do not show significant coverage (not just passing mentions) about the subject in published, reliable, secondary sources that are independent of the subject (see the guidelines on the notability of people). Before any resubmission, additional references meeting these criteria should be added (see technical help and learn about mistakes to avoid when addressing this issue). If no additional references exist, the subject is not suitable for Wikipedia. Declined by GSS 8 months ago. | |
Comment: Currently is lacking in significant coverage from reliable, secondary sources, per Wikipedia's notability guidelines. No need to link pdf urls from madri.mit.edu. Utopes (talk / cont) 23:28, 25 April 2024 (UTC)
Aleksander Mądry | |
|---|---|
| Alma mater | Massachusetts Institute of Technology (PhD) |
| Scientific career | |
| Fields | Computer Science |
| Institutions | Massachusetts Institute of Technology |
| Thesis | From Graphs to Matrices, and Back: New Techniques for Graph Algorithms (2011) |
| Doctoral advisor | Michel Xavier Goemans and Jonathan A. Kelner |
Aleksander Madry is a Polish computer science professor at the Massachusetts Institute of Technology (MIT) and a principal investigator at MIT’s Computer Science and Artificial Intelligence Laboratory (CSAIL) who conducts research in the fields of algorithms, machine learning and optimization.
As of 2024 he is on leave at OpenAI leading preparedness team.[1][2][3]
Biography
editAleksander Mądry was born in Wrocław, Poland and obtained a bachelor's degree in theoretical physics from the University of Wrocław. He continued his studies at the Massachusetts Institute of Technology with an M.S. in computer science ("Faster Generation of Random Spanning Trees") and a Ph.D. in 2011 [2] under the supervision of Michel Xavier Goemans and Jonathan A. Kelner ("From Graphs to Matrices, and Back: New Techniques for Graph Algorithms"). His dissertation was awarded the Association of Computing Machinery’s Doctoral Dissertation Award Honorable Mention.[4] and MIT’s George M. Sprowls Award for best thesis in computer science[5]
In 2015 he joined the MIT Electrical Engineering and Computer Science Department.
Research
editAleksander Mądry's early work made substantial contributions to the theory of algorithms[6]. In 2011 he developed an approximation algorithm for the maximum flow problem, the first improvement in many years. And then, in 2013, he gave an exact calculation algorithm for the maximum flow problem which was the first to improve on the prior bound of Evan and Tarjan in 1975[7]. Mądry also contributed advances in the k-server problem and the traveling salesman problem [8]. The Pressburger Award wrote: "Aleksander’s results have been celebrated in the community not only because he broke long standing complexity barriers but moreover because he introduced new and very different techniques to the field which since have successfully been picked up by others."
Mądry's most recent work focuses on machine learning and artificial intelligence. In 2018 he developed a method of "adversarial training" to improve the robustness of machine learning models[9]. Since 2018 Mądry has extended his work to cover other areas of explaining why machine learning works, and investigating the role of data in the accuracy of machine learning models.
Mądry has testified to congress on the dangers of the use of machine learning.[10]
Awards
edit- Pressburger Award 2018. (https://eatcs.org/index.php/presburger)
- FOCS 2013. Best Paper Award
- FOCS 2011. Best Paper Award
- STOC 2011. Best Paper Award
- SODA 2011. Best Paper Award
References
edit- ^ "How OpenAI Is Preparing For Future Safety Challenges". Forbes. Retrieved 2024-06-10.
- ^ Vynck, Gerrit De (2023-12-18). "OpenAI lays out plan for dealing with dangers of AI". Washington Post. ISSN 0190-8286. Retrieved 2024-06-10.
- ^ Metz, Rachel (December 18, 2023). "OpenAI Says Board Can Overrule CEO on Safety of New AI Releases". www.bloomberg.com. Retrieved 2024-06-10.
- ^ "Aleksander Madry". acm.org.
- ^ "Doing Machine Learning the Right Way". eecs.mit.edu.
- ^ "The Presburger Award 2018 Laudatio for Aleksander Madry" (PDF).
- ^ Madry, Aleksander (2013). "Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 253–262. arXiv:1307.2205. doi:10.1109/FOCS.2013.35. ISBN 978-0-7695-5135-7. S2CID 2324433. Retrieved 2024-03-04.
- ^ Asadpour, Arash; Goemans, Michel X.; Mądry, Aleksander; Gharan, Shayan Oveis; Saberi, Amin (2010-01-17). An O (log n /log log n )-approximation Algorithm for the Asymmetric Traveling Salesman Problem. Society for Industrial and Applied Mathematics. pp. 379–389. doi:10.1137/1.9781611973075.32. ISBN 978-0-89871-701-3.
- ^ Madry, Aleksander; Makelov, Aleksandar; Schmidt, Ludwig; Tsipras, Dimitris; Vladu, Adrian (2019-09-04), Towards Deep Learning Models Resistant to Adversarial Attacks, arXiv:1706.06083
- ^ "MIT professor to Congress: "We are at an inflection point" with AI". MIT News | Massachusetts Institute of Technology. 2023-03-10. Retrieved 2024-06-10.
External links
edit
Category:Living people
Category:Massachusetts Institute of Technology alumni