Faster Rectangular Matrix Multiplication by Combination Loss Analysis
François Le Gall
Abstract
Duan, Wu and Zhou (FOCS 2023) recently obtained the improved upper bound on the exponent of square matrix multiplication ω < 2.3719 by introducing a new approach to quantify and compensate the “combination loss” in prior analyses of powers of the Coppersmith-Winograd tensor. In this paper we show how to use this new approach to improve the exponent of rectangular matrix multiplication as well. Our main technical contribution is showing how to combine this analysis of the combination loss and the analysis of the fourth power of the Coppersmith-Winograd tensor in the context of rectangular matrix multiplication developed by Le Gall and Urrutia (SODA 2018).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers9
- New Bounds for Matrix Multiplication: from Alpha to OmegaVirginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei ZhouSODA 2024 · 90 citations
- More Asymmetry Yields Faster Matrix MultiplicationJosh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu et al.SODA 2025 · 35 citations
- Improving the Leading Constant of Matrix MultiplicationJosh Alman, Hantao YuSODA 2025 · 2 citations
- Convex Minimization with Integer Minima in Õ(n4) TimeHaotian Jiang, Yin Tat Lee, Zhao Song, Lichen ZhangSODA 2024 · 2 citations
- Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin WalkYuzhou Gu, Nikki Lijing Kuang, Yian Ma, Zhao Song et al.NeurIPS 2024 · 2 citations
Builds on2
Related papers
- The Time Complexity of Fully Sparse Matrix MultiplicationAmir Abboud, Karl Bringmann, Nick Fischer, Marvin KünnemannSODA 2024 · 6 citations
- Faster Algorithms for Bounded-Difference Min-Plus ProductShucheng Chi, Ran Duan, Tianle XieSODA 2022 · 5 citations
- Overcomplete Tensor Decomposition via Koszul-Young FlatteningsPravesh K. Kothari, Ankur Moitra, Alexander S. WeinFOCS 2025 · 1 citation
- Fast Batch Matrix Multiplication in CiphertextsJung Hee Cheon, Minsik Kang, Junho LeeCRYPTO 2026 · 2 citations
- Kronecker products, low-depth circuits, and matrix rigidityJosh AlmanSTOC 2021 · 8 citations
