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.

This paper develops an algorithm to multiply a p × 2 matrix by a 2 × n matrix in $\lceil (3pn + \max (n, p))/2\rceil$ multiplications without use of commutativity of matrix elements. The algorithm ...

The matrix multiplication infix operator (*) produces a new matrix by performing matrix multiplication. The first matrix must have the same number of columns as the second matrix has rows.

Researchers upend AI status quo by eliminating matrix multiplication in LLMs Running AI models without floating point matrix math could mean far less power consumption.