Faster Rectangular Matrix Multiplication by Combination Loss Analysis
Not on the map. Why?
Abstract (arXiv)
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).
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Jul 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 3.
5 papers.
- 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Timecited by 30
- 2024A Tighter Complexity Analysis of SparseGPTcited by 19
- 2023Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameterscited by 7
- 2024How to Inverting the Leverage Score Distribution?cited by 5
- 2024Inverting the Leverage Score Gradient: An Efficient Approximate Newton Methodcited by 3
- 2024A Tighter Complexity Analysis of SparseGPT22 Aug 2024
- 2024Inverting the Leverage Score Gradient: An Efficient Approximate Newton Method21 Aug 2024
- 2024How to Inverting the Leverage Score Distribution?21 Apr 2024
- 2023Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters24 Nov 2023
- 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time14 Sep 2023