# Efficiently Correcting Matrix Products

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

## Key facts

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

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

- [Syndrome Decoding for Silent Data Corruption in Quantized Integer GPU Arithmetic](https://mlsanity.com/paper/2609.19743/) (2026)

## Abstract (arXiv)

We study the problem of efficiently correcting an erroneous product of two n× n matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most k erroneous entries running in tildeO(n2+kn) time and a deterministic tildeO(kn2)-time algorithm for this problem (where the notation tildeO suppresses polylogarithmic terms in n and k).