Aleksander Madry

According to our database1, Aleksander Madry authored at least 100 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Attribute-to-Delete: Machine Unlearning via Datamodel Matching.
CoRR, 2024

GPT-4o System Card.
CoRR, 2024

MLE-bench: Evaluating Machine Learning Agents on Machine Learning Engineering.
CoRR, 2024

ContextCite: Attributing Model Generation to Context.
CoRR, 2024

Data Debiasing with Datamodels (D3M): Improving Subgroup Robustness via Data Selection.
CoRR, 2024

Ask Your Distribution Shift if Pre-Training is Right for You.
CoRR, 2024

User Strategization and Trustworthy Algorithms.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Measuring Strategization in Recommendation: Users Adapt Their Behavior to Shape Future Content.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Decomposing and Editing Predictions by Modeling Model Computation.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

DsDm: Model-Aware Dataset Selection with Datamodels.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Dataset Security for Machine Learning: Data Poisoning, Backdoor Attacks, and Defenses.
IEEE Trans. Pattern Anal. Mach. Intell., 2023

The Journey, Not the Destination: How Data Guides Diffusion Models.
CoRR, 2023

A User-Driven Framework for Regulating and Auditing Social Media.
CoRR, 2023

Dataset Interfaces: Diagnosing Model Failures Using Controllable Counterfactual Generation.
CoRR, 2023

ModelDiff: A Framework for Comparing Learning Algorithms.
Proceedings of the International Conference on Machine Learning, 2023

Raising the Cost of Malicious AI-Powered Image Editing.
Proceedings of the International Conference on Machine Learning, 2023

TRAK: Attributing Model Behavior at Scale.
Proceedings of the International Conference on Machine Learning, 2023

Rethinking Backdoor Attacks.
Proceedings of the International Conference on Machine Learning, 2023

Distilling Model Failures as Directions in Latent Space.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

FFCV: Accelerating Training by Removing Data Bottlenecks.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

A Data-Based Perspective on Transfer Learning.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

2022
When does Bias Transfer in Transfer Learning?
CoRR, 2022

Adversarially trained neural representations may already be as robust as corresponding biological neural representations.
CoRR, 2022

Datamodels: Predicting Predictions from Training Data.
CoRR, 2022

3DB: A Framework for Debugging Computer Vision Models.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Combining Diverse Feature Priors.
Proceedings of the International Conference on Machine Learning, 2022

Datamodels: Understanding Predictions with Data and Data with Predictions.
Proceedings of the International Conference on Machine Learning, 2022

Adversarially trained neural representations are already as robust as biological neural representations.
Proceedings of the International Conference on Machine Learning, 2022

Missingness Bias in Model Debugging.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Certified Patch Robustness via Smoothed Vision Transformers.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021
On Distinctive Properties of Universal Perturbations.
CoRR, 2021

Editing a classifier by rewriting its prediction rules.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Unadversarial Examples: Designing Objects for Robust Vision.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Leveraging Sparse Linear Layers for Debuggable Deep Networks.
Proceedings of the 38th International Conference on Machine Learning, 2021

Noise or Signal: The Role of Image Backgrounds in Object Recognition.
Proceedings of the 9th International Conference on Learning Representations, 2021

BREEDS: Benchmarks for Subpopulation Shift.
Proceedings of the 9th International Conference on Learning Representations, 2021

Faster Sparse Minimum Cost Flow by Electrical Flow Localization.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Round Compression for Parallel Matching Algorithms.
SIAM J. Comput., 2020

Implementation Matters in Deep Policy Gradients: A Case Study on PPO and TRPO.
CoRR, 2020

The Two Regimes of Deep Network Training.
CoRR, 2020

On Adaptive Attacks to Adversarial Example Defenses.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Do Adversarially Robust ImageNet Models Transfer Better?
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

From ImageNet to Image Classification: Contextualizing Progress on Benchmarks.
Proceedings of the 37th International Conference on Machine Learning, 2020

Identifying Statistical Bias in Dataset Replication.
Proceedings of the 37th International Conference on Machine Learning, 2020

A Closer Look at Deep Policy Gradients.
Proceedings of the 8th International Conference on Learning Representations, 2020

Implementation Matters in Deep RL: A Case Study on PPO and TRPO.
Proceedings of the 8th International Conference on Learning Representations, 2020

Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Label-Consistent Backdoor Attacks.
CoRR, 2019

Computer Vision with a Single (Robust) Classifier.
CoRR, 2019

Learning Perceptually-Aligned Representations via Adversarial Robustness.
CoRR, 2019

On Evaluating Adversarial Robustness.
CoRR, 2019

Image Synthesis with a Single (Robust) Classifier.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Adversarial Examples Are Not Bugs, They Are Features.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Exploring the Landscape of Spatial Robustness.
Proceedings of the 36th International Conference on Machine Learning, 2019

Training for Faster Adversarial Robustness Verification via Inducing ReLU Stability.
Proceedings of the 7th International Conference on Learning Representations, 2019

Robustness May Be at Odds with Accuracy.
Proceedings of the 7th International Conference on Learning Representations, 2019

Prior Convictions: Black-box Adversarial Attacks with Bandits and Priors.
Proceedings of the 7th International Conference on Learning Representations, 2019

2018
Are Deep Policy Gradient Algorithms Truly Policy Gradient Algorithms?
CoRR, 2018

There Is No Free Lunch In Adversarial Robustness (But There Are Unexpected Benefits).
CoRR, 2018

How Does Batch Normalization Help Optimization? (No, It Is Not About Internal Covariate Shift).
CoRR, 2018

k-server via multiscale entropic regularization.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Spectral Signatures in Backdoor Attacks.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Adversarially Robust Generalization Requires More Data.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

How Does Batch Normalization Help Optimization?
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

A Classification-Based Study of Covariate Shift in GAN Distributions.
Proceedings of the 35th International Conference on Machine Learning, 2018

On the Limitations of First-Order Approximation in GAN Dynamics.
Proceedings of the 35th International Conference on Machine Learning, 2018

Towards Deep Learning Models Resistant to Adversarial Attacks.
Proceedings of the 6th International Conference on Learning Representations, 2018

A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
On the Resiliency of Static Forwarding Tables.
IEEE/ACM Trans. Netw., 2017

An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
Oper. Res., 2017

A Rotation and a Translation Suffice: Fooling CNNs with Simple Transformations.
CoRR, 2017

A Classification-Based Perspective on GAN Distributions.
CoRR, 2017

Towards Understanding the Dynamics of Generative Adversarial Networks.
CoRR, 2017

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m<sup>10/7</sup> log W) Time.
CoRR, 2016

The quest for resilient (static) forwarding tables.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

On the Resiliency of Randomized Routing Against Multiple Edge Failures.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Continuous Optimization: The "Right" Language for Graph Algorithms? (Invited Talk).
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Computing Maximum Flow with Augmenting Electrical Flows.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
On the configuration LP for maximum budgeted allocation.
Math. Program., 2015

A Polylogarithmic-Competitive Algorithm for the <i>k</i>-Server Problem.
J. ACM, 2015

Fast Generation of Random Spanning Trees and the Effective Resistance Metric.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2013
Runtime guarantees for regression problems.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2011
New techniques for graph algorithms.
PhD thesis, 2011

Maximum bipartite flow in networks with adaptive channel width.
Theor. Comput. Sci., 2011

Electrical Flow Algorithms for Total Variation Minimization
CoRR, 2011

Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

The Semi-stochastic Ski-rental Problem.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

A Polylogarithmic-Competitive Algorithm for the k-Server Problem.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
Faster Generation of Random Spanning Trees.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
Proceedings of the Approximation, 2009

2008
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Susceptible Two-Party Quantum Computations.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

2006
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Electron. Colloquium Comput. Complex., 2006

2005
Data exchange: On the complexity of answering queries with inequalities.
Inf. Process. Lett., 2005


  Loading...