19 citations · 24 across the 3 of their papers we have counts for
4 papers
Conditional Accelerated Lazy Stochastic Gradient Descent
Guanghui Lan, Sebastian Pokutta, Yi Zhou +1
In this work we introduce a conditional accelerated lazy stochastic gradient descent algorithm with optimal number of calls to a stochastic first-order oracle and convergence rate…
Lazifying Conditional Gradient Algorithms
Gábor Braun, Sebastian Pokutta, Daniel Zink
Conditional gradient algorithms (also often called Frank-Wolfe algorithms) are popular due to their simplicity of only requiring a linear optimization oracle and more recently they…
The matching problem has no small symmetric SDP
Gábor Braun, Jonah Brown-Cohen, Arefin Huq +5
Yannakakis showed that the matching problem does not have a small symmetric linear program. Rothvoß recently proved that any, not necessarily symmetric, linear program also has exp…
Affine reductions for LPs and SDPs
Gábor Braun, Sebastian Pokutta, Daniel Zink
We define a reduction mechanism for LP and SDP formulations that degrades approximation factors in a controlled fashion. Our reduction mechanism is a minor restriction of classical…