Aaron Sidford
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2023
all 5 in the filters
on a stage with
all 6 in the filters
who talks about the same things
- Dor Minzer8 talks
- Mark Braverman5 talks
- Subhash Khot3 talks
- Yuval Filmus9 talks
- Philippe Heim2 talks
- Aviad Rubinstein5 talks
| title | conference | date |
|---|---|---|
| Data Structures and Optimization for Fast Algorithms | 9th Annual Simons Institute Industry Day | 2023-11-02 |
Program surveys concrete advances that shave decades off runtimes for tasks like linear system solving, convex programming, flow and Markov decision process… | ||
| The Complexity of Infinite-Horizon General-Sum Stochastic Games | ITCS 2023 | 2023-01-10 |
Shows that finding an approximate Nash for infinite-horizon general-sum stochastic games is PPAD-complete both for simultaneous and for turn-based models under… | ||
| Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration | ITCS 2021 | 2021-01-06 |
Introduces a concrete condition called relative Lipschitzness between operator G and regularizer R and proves that standard extragradient (Mirror Prox)… | ||
| Nearly Linear Time Algorithms for Solving Inverse Symmetric M-Matrices | Sublinear Algorithms and Nearest-Neighbor Search | 2018-11-27 |
Provides algorithms that recover and solve three hard cases—perturbed Laplacians, Laplacian pseudoinverses, and inverse symmetric M-matrices—by producing a… | ||
| 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… | ||
| A Faster Algorithm for Linear Programming and the Maximum Flow Problem II | Fast Algorithms via Spectral Methods 2014 | 2014-12-01 |
Claims a linear‑program interior‑point scheme that keeps Renegar‑style cheap iterations while matching the near‑optimal central‑path convergence (roughly √n… | ||
| nothing matches | ||