math.AGFeb 25, 2026

Neural Learning of Fast Matrix Multiplication Algorithms: A StrassenNet Approach

Authors: Paolo Andreini, Alessandra Bernardi, Monica Bianchini, Barbara Toniella Corradini, Sara Marziali, Giacomo Nunziati, Franco Scarselli

Abstract

Fast matrix multiplication can be described as searching for low-rank decompositions of the matrix--multiplication tensor. We design a neural architecture, StrassenNet, which reproduces the Strassen algorithm for 2×22\times 2 multiplication. Across many independent runs the network always converges to a rank-77 tensor, thus numerically recovering Strassen's optimal algorithm. We then train the same architecture on 3×33\times 3 multiplication with rank r∈{19,…,23}r\in\{19,\dots,23\}. Our experiments reveal a clear numerical threshold: models with r=23r=23 attain significantly lower validation error than those with r≤22r\le 22, suggesting that r=23r=23 could actually be the smallest effective rank of the matrix multiplication tensor 3×33\times 3. We also sketch an extension of the method to border-rank decompositions via an ε\varepsilon--parametrisation and report preliminary results consistent with the known bounds for the border rank of the 3×33\times 3 matrix--multiplication tensor.

Figures & tables

Explore similar work

CardsList
  1. Improving the matrix multiplication exponent with modern optimization and AlphaEvolve

    Aug 17, 2026Emilien Dupont, Marvin Eisenberger, Borislav Kozlovskii +7Matrix Optimization

  2. Change the Product, Keep the Parameters: Associative Algebra Layers for Transformers

    Sep 26, 2026Ilya Koziev, Ivan OseledetsTransformerLLM Inference Acceleration