Ankit Garg
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 2 in the filters
on a stage with
- Praneeth Netrapallionce
- Robin Kotharionce
- Suhail Sherifonce
who talks about the same things
- Suhail Sherif3 talks
- Kunal Marwaha3 talks
- Makrand Sinha5 talks
- Boaz Barak5 talks
- Anindya De3 talks
- Ritvik Sharma3 talks
| title | conference | date |
|---|---|---|
| No quantum speedup over gradient descent for non-smooth convex optimization | ITCS 2021 | 2021-01-06 |
Proves that quantum algorithms give no asymptotic advantage for non‑smooth 1‑Lipschitz convex optimization in high dimension by showing a matching 1/epsilon^2… | ||
| Small Value Parallel Repetition for General Games | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Proves a general parallel-repetition bound showing that when a game has initial value 1 − ε the value after n independent repetitions falls exponentially in n… | ||
| nothing matches | ||