Sahand Negahban
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| On Approximation Guarantees for Greedy Low Rank Optimization | Optimization, Statistics and Uncertainty | 2017-11-28 |
Greedy addition of rank‑one atoms achieves a provable multiplicative approximation: objective of the K‑rank greedy iterate is within a factor ~1 − exp(−C K/R)… | ||
| nothing matches | ||