mlsanityData to 14 Oct 2026

Faster Rectangular Matrix Multiplication by Combination Loss Analysis

arXiv 2307.06535 ↗First posted 13 Jul 2023cs.DS cs.CC cs.SCcited by 5

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

Cited by year

Citing papers per year: 2023: 2; 2024: 3.

5 papers.