Abstract: Alternative basis matrix multiplication algorithms are the fastest matrix multiplication algorithms in practice to date. However, are they numerically ...

Strassen's algorithm is a divide and conquer algorithm for multiplying two square matrices of dimension n by n where n is a power of 2. The runtime is O(n^log_2(7)) which beats the naive O(n^3) ...

Abstract: Fast matrix multiplication is one of the most fundamental problems in algorithm research. The exponent of the optimal time complexity of matrix multiplication is usually denoted by $\omega$.

Matrix multiplication (GEMM) is a core operation to numerous scientific applications. Traditional implementations of Strassen-like fast matrix multiplication (FMM) algorithms often do not perform well ...

Solving many scientific and technical applications entails the use of matrix multiplies somewhere in the algorithm and thus the computer code. With today’s multicore CPUs, proper use of complier ...

The new version of AlphaZero discovered a faster way to do matrix multiplication, a core problem in computing that affects thousands of everyday computer tasks. DeepMind has used its board-game ...

AI training time is at a point in an exponential where more throughput isn't going to advance functionality much at all. The underlying problem, problem solving by training, is computationally ...