1.6k citations · 2k across the 26 of their papers we have counts for
1 paper · 1 filter
Sébastien Bubeck, Qijia Jiang, Yin Tat Lee +2
A landmark result of non-smooth convex optimization is that gradient descent is an optimal algorithm whenever the number of computed gradients is smaller than the dimension d. In…