Aleksander Madry
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
no series more than once — all 4 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| A New Perspective on Adversarial Perturbations | Frontiers of Deep Learning 2019 | 2019-07-15 |
Claim: adversarial examples come from non-robust features in the data that reliably predict labels but flip under tiny perturbations. Specific experiment… | ||
| Is AI human-ready? | O'Reilly Artificial Intelligence Conference 2019 - New York, New York | 2019-04-15 |
State-of-the-art classifiers flip from “pig” to “airliner” with 99% confidence after a small, carefully chosen noise pattern, and MIT students print a turtle… | ||
| Interior Point Methods 1 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Lecture claims simple Newton-style primal‑dual schemes solve LP by following the central path and driving the duality gap mu to zero, using only linear solves… | ||
| Interior Point Methods 2 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Covers concrete algorithms and guarantees: path-following Newton steps on the log barrier give the usual sqrt(n) iteration bound for short-step primal‑dual… | ||
| Interior Point Methods 3 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Derives a path-following interior‑point method that minimizes the barrier f_mu = (c^T x)/mu + sum_j -log(slack_j) using Newton steps in the local Hessian norm… | ||
| Interior Point Methods 4 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Claims an interior-point framework that gets sqrt(d) iterations while keeping each step as cheap as a projection-based Newton solve, yielding runtimes about… | ||
| Electrical Flows Primitive and Fast Graph Algorithms | Fast Algorithms via Spectral Methods 2014 | 2014-12-01 |
Argues that electrical flow computed via fast Laplacian solvers becomes a basic primitive that, when wrapped in a multiplicative weights iterative scheme… | ||
| nothing matches | ||