Skip to main content
QUICK REVIEW

[论文解读] A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications

Jean‐Guillaume Dumas, Clément Pernet|arXiv (Cornell University)|Mar 19, 2026
Tensor decomposition and applicationsMathematics被引用 0
一句话总结

提出一个在含有 2 的逆元的环上进行 4x4x4:48 矩阵乘法的更精确变体,最大范数误差界的指数约为 2.386,实际精度有所提升。

ABSTRACT

We propose a more accurate variant of an algorithm for multiplying 4x4 matrices using 48 multiplications over any ring containing an inverse of 2. This algorithm has an error bound exponent of only log 4 $γ$$\infty$,2 $\approx$ 2.386. It also reaches a better accuracy w.r.t. max-norm in practice, when compared to previously known such fast algorithms. Furthermore, we propose a straight line program of this algorithm, giving a leading constant in its complexity bound of 387 32 n 2+log 4 3 + o n 2+log 4 3 operations over any ring containing an inverse of 2. Introduction: An algorithm to multiply two 4x4 complex-valued matrices requiring only 48 non-commutative multiplications was introduced in [16] 1 using a pipeline of large language models orchestrated by an evolutionary coding agent. A matrix multiplication algorithm with that many non-commutative multiplications is denoted by ___4x4x4:48___ in the sequel. An equivalent variant of the associated tensor decomposition defining this algorithm, but over the rationals (more precisely over any ring containing an inverse of 2), was then given in [8]. Most error analysis of sub-cubic time matrix multiplication algorithms [3, 4, 2, 1, 17] are given in the max-norm setting: bounding the largest output error as a function of the max-norm product of the vectors of input matrix coefficients. In this setting, Strassen's algorithm has shown the best accuracy bound, (proven minimal under some assumptions in [2]). In [6, 8], the authors relaxed this setting by shifting the focus to the 2-norm for input and/or output; that allowed them to propose a ___2x2x2:7___ variant with an improved accuracy bound. Experiments show that this variant performs best even when measuring the max-norm of the error bound. We present in this note a variant of the recent ___4x4x4:48___ algorithm over the rationals (again in the same orbit under De Groot isotropies [10]) that is more numerically accurate w.r.t. max-norm in practice. In particular, our new variant improves on the error bound exponent, from log 2 $γ$ $\infty$,2 $\approx$ 2.577 Consider the product of an M x K matrix A by a K x N matrix B. It is computed by a ___m, k, n___ algorithm represented by the matrices L, R, P applied recursively on ${\ell}$ recursive levels and the resulting m 0 x k 0 by k 0 x n 0 products are performed using an algorithm $β$. Here M = m 0 m ${\ell}$ , K = k 0 k ${\ell}$ and n = n 0 n ${\ell}$ . The accuracy bound below uses any (possibly different) p-norms and q-norms for its left-handside, ___$\bullet$___ p and right-hand side, ___$\bullet$___ q . The associated dual norms, are denoted by ___$\bullet$___ p $\star$ and ___$\bullet$___ q $\star$ respectively. Note that, these are vector norms, hence ___A___ p for matrix A in R mxn denotes ___Vect(A)___ p and is the p-norm of the mn dimensional vector of its coefficients, and not a matrix norm.

研究动机与目标

  • 在 max-norm 设置下,推动子二次矩阵乘法并提高数值稳定性。
  • 在包含 1/2 的环上,开发一个更高精度的 4x4x4:48 算法变体。
  • 提供一个具体的 LRP 表示与直接线性程序 (SLP) 实现。
  • 将理论误差界与先前算法进行比较,并展示实际精度。
  • 给出复杂性界,并讨论替代基变体。

提出的方法

  • 用 LRP (L, R, P) 三元组表示 4x4 矩阵乘法的双线性映射。
  • 引入一个新的 4x4x4:48 算法变体,给出特定的 L, R, P,降低 (p,q)=(2,2) 与 (∞,2) 时的 gamma_{p,q} 增长因子。
  • 推导 L、R、P 的显式直线程序(表 1)及相应的、优化后的算术,包括 Hadamard 乘积。
  • 利用 gamma_{p,q} 增长因子分析前向误差,并给出相对于范数的界限 f_{p,q}。
  • 给出详细的复杂性界(此处不要求给出 45 的具体数字)并在附录 A 给出一种替代基变体。

实验结果

研究问题

  • RQ1在含 1/2 的环上,使用 48 次乘法的理性非对称 4x4 矩阵乘法能达到的最大精度提升是多少?
  • RQ2新变体在 (p,q) 范数下对前向误差界的影响,特别是 (2,2) 与 (∞,2)?
  • RQ3实现所需的显式 L、R、P 表示及相应的直线程序(SLP)?
  • RQ4新变体在理论增长因子和实际最大范数精度方面,与之前的 4x4x4:48 方案相比有何差异?
  • RQ5采用替代基对该算法的复杂性有何影响?

主要发现

  • 新变体在前向误差界的指数为 log_4 gamma_{∞,2} ≈ 2.386。
  • gamma_{2,2} 增长因子降低到 (1+sqrt(2))·64,提升相对于之前的 4x4x4:48 方案的精度阶。
  • 复杂性界中的主常数为 387/32,并给出更精细的渐近项,得到大约 12.09375 n^{2+log_4 3} - 11.09375 n^2 次运算(在包含 1/2 的环上)。
  • 该变体提供了 L、R、P 的显式直线程序 (SLP),便于实际实现和基准测试。
  • 附录 A 给出一种替代基,具有相似精度且界中的常数因子较小(8n^{2+log_4 3}+o(...))。
  • 实验表明,新型的 4x4x4:48 变体在最大范数输出误差方面,比先前的 2x2x2:7 与 4x4x4:48 方案更为准确。

阅读本论文

在 Nubint 阅读器中打开原文,边读边就任意段落提问。

在 Nubint 中阅读本论文

本解读由 AI 根据论文原文生成,引用前请核对原文。