Papers › Rows vs. Columns: Randomized Kaczmarz or Gauss-Seidel for Ridge Regression
Rows vs. Columns: Randomized Kaczmarz or Gauss-Seidel for Ridge Regression
Ahmed Hefny, Deanna Needell, Aaditya Ramdas
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Kaczmarz and Gauss-Seidel methods aim to solve a linear m ×n system X β = y by iteratively refining the solution estimate; the former uses random rows of X {to update β given the corresponding equations} and the latter uses random columns of X {to update corresponding coordinates in β}. Interest in these methods was recently revitalized by a proof of Strohmer and Vershynin showing linear convergence in expectation for a \textit{randomized} Kaczmarz method variant (RK), and a similar result for the randomized Gauss-Seidel algorithm (RGS) was later proved by Lewis and Leventhal. Recent work unified the analysis of these algorithms for the overcomplete and undercomplete systems, showing convergence to the ordinary least squares (OLS) solution and the minimum Euclidean norm solution respectively. This paper considers the natural follow-up to the OLS problem, ridge regression, which solves (X^* X + λI) β = X^* y. We present particular variants of RK and RGS for solving this system and derive their convergence rates. We compare these to a recent proposal by Ivanov and Zhdanov to solve this system, that can be interpreted as randomly sampling both rows and columns, which we argue is often suboptimal. Instead, we claim that one should always use RGS (columns) when m > n and RK (rows) when m < n. This difference in behavior is simply related to the minimum eigenvalue of two related positive semidefinite matrices, X^* X + λIₙ and X X^* + λIₘ when m > n or m < n.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections