# On the Randomized Kaczmarz Algorithm

arXiv: https://arxiv.org/abs/1402.2863 · HTML: https://mlsanity.com/paper/1402.2863/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Feb 2014.

## Built on by (most cited first, 5 of 5)

- [UNO: Unlimited Sampling Meets One-Bit Quantization](https://mlsanity.com/paper/2301.10155/) (2022)
- [KCLNet: Physics-Informed Power Flow Prediction via Constraints Projections](https://mlsanity.com/paper/2506.12902/) (2025)
- [Linear Discriminant Analysis with the Randomized Kaczmarz Method](https://mlsanity.com/paper/2211.05749/) (2022)
- [ORKA: Accelerated Kaczmarz Algorithms for Signal Recovery from One-Bit Samples](https://mlsanity.com/paper/2301.03467/) (2022)
- [One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear Feasibility](https://mlsanity.com/paper/2303.09594/) (2023)

## Abstract (arXiv)

The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related to the question raised by citec2. Illustrative experiments are conducted to support the findings.