Lorenzo Orecchia
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Continuous Methods 1 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Asserts that designing first-order algorithms from continuous dynamics plus conjugate duality yields a mechanical recipe: pick mirror map via conjugate… | ||
| Continuous Methods 2 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Claims that continuous-time gap invariants plus two discretization recipes produce accelerated O(1/T^2) convergence for convex problems, with concrete… | ||
| Continuous Methods 3 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Shows that a submodular set function has a convex continuous extension via the Lovász extension and a dual base polytope whose linear optimization costs O(n… | ||
| Continuous Methods 4 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Compares two greedy online algorithms — sequential greedy (Frank‑Wolfe/forward Euler style) and simultaneous greedy (implicit/backward update) — and proves… | ||
| First-Order Optimization and Online Learning Techniques in the Design of Fast Spectral Algorithms | Fast Algorithms via Spectral Methods 2014 | 2014-12-01 |
First-order iterative methods combine multiplicative weight updates and gradient descent (plus regularizers like entropy or sqrt(p)) to convert Laplacian-based… | ||
| nothing matches | ||