| Towards deep learning models resistant to adversarial attacks A Madry, A Makelov, L Schmidt, D Tsipras, A Vladu Proceedings of the International Conference on Representation Learning (ICLR …, 2017 | 2752 | 2017 |
| How does batch normalization help optimization? S Santurkar, D Tsipras, A Ilyas, A Madry arXiv preprint arXiv:1805.11604, 2018 | 550 | 2018 |
| Robustness may be at odds with accuracy D Tsipras, S Santurkar, L Engstrom, A Turner, A Madry Proceedings of the International Conference on Representation Learning (ICLR …, 2018 | 485* | 2018 |
| Adversarial examples are not bugs, they are features A Ilyas, S Santurkar, D Tsipras, L Engstrom, B Tran, A Madry arXiv preprint arXiv:1905.02175, 2019 | 418 | 2019 |
| Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs P Christiano, JA Kelner, A Madry, DA Spielman, SH Teng Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 301 | 2011 |
| Adversarially robust generalization requires more data L Schmidt, S Santurkar, D Tsipras, K Talwar, A Mądry arXiv preprint arXiv:1804.11285, 2018 | 299 | 2018 |
| Exploring the landscape of spatial robustness L Engstrom, B Tran, D Tsipras, L Schmidt, A Madry International Conference on Machine Learning, 1802-1811, 2019 | 297* | 2019 |
| On evaluating adversarial robustness N Carlini, A Athalye, N Papernot, W Brendel, J Rauber, D Tsipras, ... arXiv preprint arXiv:1902.06705, 2019 | 248 | 2019 |
| Navigating central path with electrical flows: From flows to matchings, and back A Madry 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 253-262, 2013 | 201 | 2013 |
| An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem A Asadpour, MX Goemans, A Mądry, SO Gharan, A Saberi Operations Research 65 (4), 1043-1061, 2017 | 200 | 2017 |
| Prior convictions: Black-box adversarial attacks with bandits and priors A Ilyas, L Engstrom, A Madry arXiv preprint arXiv:1807.07978, 2018 | 127 | 2018 |
| Spectral signatures in backdoor attacks B Tran, J Li, A Madry arXiv preprint arXiv:1811.00636, 2018 | 121 | 2018 |
| A Polylogarithmic-Competitive Algorithm for the k-Server Problem N Bansal, N Buchbinder, A Madry, J Naor Journal of the ACM (JACM) 62 (5), 1-49, 2015 | 116 | 2015 |
| Faster generation of random spanning trees JA Kelner, A Madry 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 13-21, 2009 | 102 | 2009 |
| Fast approximation algorithms for cut-based problems in undirected graphs A Madry 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 245-254, 2010 | 88 | 2010 |
| Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms A Madry Proceedings of the forty-second ACM symposium on Theory of computing, 121-130, 2010 | 87 | 2010 |
| On adaptive attacks to adversarial example defenses F Tramer, N Carlini, W Brendel, A Madry arXiv preprint arXiv:2002.08347, 2020 | 83 | 2020 |
| Training for faster adversarial robustness verification via inducing relu stability KY Xiao, V Tjeng, NM Shafiullah, A Madry arXiv preprint arXiv:1809.03008, 2018 | 76 | 2018 |
| Computing maximum flow with augmenting electrical flows A Madry 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 67 | 2016 |
| Matrix scaling and balancing via box constrained Newton's method and interior point methods MB Cohen, A Madry, D Tsipras, A Vladu 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 65 | 2017 |
Dimitris TsiprasMassachusetts Institute of TechnologyVerified email at mit.edu
