Model Releases
How AI settled the complexity of the oldest SGD algorithm
arXiv:2606.29593v1 Announce Type: cross Abstract: In 1937, Stefan Kaczmarz proposed a simple algorithm for solving systems of linear equations. This algorithm turned out to be the earliest known examp
arXiv:2606.29593v1 Announce Type: cross Abstract: 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 descent, a ubiquitous computing paradigm that drives the training of modern AI models such as ChatGPT and Gemini. Now, those AI models have joined forces to discover the worst-case complexity of the Kaczmarz algorithm. This paper tells the story of how it happened.
Source: arXiv cs.AI | 2026-06-30