Fast Matrix Multiplication in Small Formats: Discovering New Schemes with an Open-Source Flip Graph Framework
A. I. Perminov

TL;DR
This paper introduces an open-source framework for discovering fast matrix multiplication schemes across various coefficient rings, leading to new schemes with reduced multiplicative complexity and improved exponents, advancing computational efficiency.
Contribution
The authors present a novel open-source flip graph framework supporting multiple coefficient rings, enabling large-scale discovery of efficient matrix multiplication schemes with improved complexity.
Findings
Discovered a new 4x4x10 scheme with 115 multiplications, beating Strassen's exponent.
Revealed 680 schemes across different sizes and coefficient rings.
Reproduced many known schemes, confirming the framework's effectiveness.
Abstract
An open-source C++ framework for discovering fast matrix multiplication schemes using the flip graph approach is presented. The framework supports multiple coefficient rings -- binary (), modular ternary () and integer ternary () -- and implements both fixed-dimension and meta-dimensional search operators. Using efficient bit-level encoding of coefficient vectors and OpenMP parallelism, the tools enable large-scale exploration on commodity hardware. The study covers 680 schemes ranging from to , with 276 schemes now in coefficients and 117 in integer coefficients. With this framework, the multiplicative complexity (rank) is improved for 79 matrix multiplication schemes. Notably, a new scheme requiring only 115 multiplications is discovered,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Tensor decomposition and applications · Polynomial and algebraic computation
