NANAJul 25, 2016

Improving the numerical stability of fast matrix multiplication

arXiv:1507.0068742 citations
Originality Incremental advance
AI Analysis

For practitioners in scientific computing and machine learning who seek performance gains from fast matrix multiplication without sacrificing numerical accuracy, this work provides theoretical and empirical evidence that the numerical sacrifice is manageable and offers methods to enhance stability.

This paper argues that the numerical instability of fast matrix multiplication algorithms is not prohibitive for practical use, and proposes algorithmic techniques and diagonal scaling to improve accuracy, demonstrating improved numerical stability in benchmarks.

Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used even in cases where they provide a performance benefit. We argue in this paper that the numerical sacrifice of fast algorithms, particularly for the typical use cases of practical algorithms, is not prohibitive, and we explore ways to improve the accuracy both theoretically and empirically. The numerical accuracy of fast matrix multiplication depends on properties of the algorithm and of the input matrices, and we consider both contributions independently. We generalize and tighten previous error analyses of fast algorithms and compare their properties. We discuss algorithmic techniques for improving the error guarantees from two perspectives: manipulating the algorithms, and reducing input anomalies by various forms of diagonal scaling. Finally, we benchmark performance and demonstrate our improved numerical accuracy.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes