# Stochastic Rounding 2.0, with a View towards Complexity Analysis

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Oct 2024.

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

- [Solving Sparse Finite Element Problems on Neuromorphic Hardware](https://mlsanity.com/paper/2501.10526/) (2025)
- [Stochastic Rounding Increases Small Singular Values](https://mlsanity.com/paper/2606.00312/) (2026)

## Abstract (arXiv)

Stochastic Rounding is a probabilistic rounding mode that is surprisingly effective in large-scale computations and low-precision arithmetic. Its random nature promotes error cancellation rather than error accumulation, resulting in slower growth of roundoff errors as the problem size increases, especially when compared to traditional deterministic rounding methods, such as rounding-to-nearest. We advocate for SR as a foundational tool in the complexity analysis of algorithms, and suggest several research directions.