Aleksander Mądry
Aleksander Mądry
Verified email at mit.edu - Homepage
TitleCited byYear
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
13152017
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
2742011
How does batch normalization help optimization?
S Santurkar, D Tsipras, A Ilyas, A Madry
Advances in Neural Information Processing Systems, 2483-2493, 2018
242*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
217*2018
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
1772017
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
1682013
Adversarially robust generalization requires more data
L Schmidt, S Santurkar, D Tsipras, K Talwar, A Madry
Advances in Neural Information Processing Systems, 5014-5026, 2018
1432018
Exploring the landscape of spatial robustness
L Engstrom, B Tran, D Tsipras, L Schmidt, A Madry
arXiv preprint arXiv:1712.02779, 2017
137*2017
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
110*2015
Adversarial examples are not bugs, they are features
A Ilyas, S Santurkar, D Tsipras, L Engstrom, B Tran, A Madry
Advances in Neural Information Processing Systems, 125-136, 2019
1032019
Faster generation of random spanning trees
JA Kelner, A Madry
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 13-21, 2009
872009
On evaluating adversarial robustness
N Carlini, A Athalye, N Papernot, W Brendel, J Rauber, D Tsipras, ...
arXiv preprint arXiv:1902.06705, 2019
802019
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
732010
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
722010
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
482017
Prior convictions: Black-box adversarial attacks with bandits and priors
A Ilyas, L Engstrom, A Madry
arXiv preprint arXiv:1807.07978, 2018
462018
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time
MB Cohen, A Mądry, P Sankowski, A Vladu
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
452017
Round Compression for Parallel Matching Algorithms
A Mądry, A Czumaj, K Onak, J Łącki, P Sankowski, S Mitrović
44*2018
Computing maximum flow with augmenting electrical flows
A Madry
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
432016
A 7/9-approximation algorithm for the maximum traveling salesman problem
K Paluch, M Mucha, A Madry
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
422009
The system can't perform the operation now. Try again later.
Articles 1–20