# Randomization of Approximate Bilinear Computation for Matrix Multiplication

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 May 2019.

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

- [Beyond Accuracy: Prefix-Invariant Realizations of Low-Precision Fast Matrix Multiplication](https://mlsanity.com/paper/2609.39816/) (2026)

## Abstract (arXiv)

We present a method for randomizing formulas for bilinear computation of matrix products. We consider the implications of such randomization when there are two sources of error: One due to the formula itself only being approximately correct, and one due to using floating point arithmetic. Our theoretical results and numerical experiments indicate that our method can improve performance when each of these error sources are present individually, as well as when they are present at the same time.