6 citations · 9 across the 23 of their papers we have counts for
Showing 2026 · cs.LGShow all
3 papers · 2 filters
cs.LG2026
How AI settled the complexity of the oldest SGD algorithm
Michał Dereziński, Xiaoyu Dong
In 1937, Stefan Kaczmarz proposed a simple algorithm for solving systems of linear equations. This algorithm turned out to be the earliest known example of stochastic gradient desc…
cs.LG2026
Perfect Parallelization in Mini-Batch SGD with Classical Momentum Acceleration
Sachin Garg, Michał Dereziński
Accelerating stochastic gradient methods with classical momentum schemes, such as Polyak's heavy ball, has proven highly successful in training large-scale machine learning models,…
cs.LG2026
Last-Iterate Convergence of Randomized Kaczmarz and SGD with Greedy Step Size
Michał Dereziński, Xiaoyu Dong
We study last-iterate convergence of SGD with greedy step size over smooth quadratics in the interpolation regime, a setting which captures the classical Randomized Kaczmarz algori…