1 citations · 1 across the 10 of their papers we have counts for
6 papers · 1 filter
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…
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,…
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…
Have ASkotch: A Neat Solution for Large-scale Kernel Ridge Regression
Pratik Rathore, Zachary Frangella, Jiaming Yang +2
Kernel ridge regression (KRR) is a fundamental computational tool, appearing in problems that range from computational chemistry to health analytics, with a particular interest due…
Turbocharging Gaussian Process Inference with Approximate Sketch-and-Project
Pratik Rathore, Zachary Frangella, Sachin Garg +3
Gaussian processes (GPs) play an essential role in biostatistics, scientific machine learning, and Bayesian optimization for their ability to provide probabilistic predictions and…
Recent and Upcoming Developments in Randomized Numerical Linear Algebra for Machine Learning
MichaÅ DereziÅski, Michael W. Mahoney
Large matrices arise in many machine learning and data analysis applications, including as representations of datasets, graphs, model weights, and first and second-order derivative…