Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

More Asymmetry Yields Faster Matrix Multiplication (2404.16349v2)

Published 25 Apr 2024 in cs.DS and cs.CC

Abstract: We present a new improvement on the laser method for designing fast matrix multiplication algorithms. The new method further develops the recent advances by [Duan, Wu, Zhou FOCS 2023] and [Vassilevska Williams, Xu, Xu, Zhou SODA 2024]. Surprisingly the new improvement is achieved by incorporating more asymmetry in the analysis, circumventing a fundamental tool of prior work that requires two of the three dimensions to be treated identically. The method yields a new bound on the square matrix multiplication exponent $$\omega<2.371339,$$ improved from the previous bound of $\omega<2.371552$. We also improve the bounds of the exponents for multiplying rectangular matrices of various shapes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. Fast matrix multiplication: limitations of the Coppersmith-Winograd method. In Proceedings of the 47th Annual ACM on Symposium on Theory of Computing (STOC), pages 585–593, 2015.
  2. Josh Alman. Limits on the universal method for matrix multiplication. Theory Comput., 17:1–30, 2021.
  3. Josh Alman and Virginia Vassilevska Williams. Further limitations of the known approaches for matrix multiplication. In Proceedings of the 9th Innovations in Theoretical Computer Science Conference (ITCS), pages 25:1–25:15, 2018.
  4. Josh Alman and Virginia Vassilevska Williams. Limits on all known (and some unknown) approaches to matrix multiplication. In Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 580–591, 2018.
  5. Josh Alman and Virginia Vassilevska Williams. A refined laser method and faster matrix multiplication. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 522–539, 2021.
  6. On cap sets and the group-theoretic approach to matrix multiplication. Discret. Anal., 2017(3):1–27, 2017.
  7. Which groups are amenable to proving exponent two for matrix multiplication? arXiv:1712.02302, 2017.
  8. O⁢(n2.7799)𝑂superscript𝑛2.7799{O}(n^{2.7799})italic_O ( italic_n start_POSTSUPERSCRIPT 2.7799 end_POSTSUPERSCRIPT ) complexity for n×n𝑛𝑛n\times nitalic_n × italic_n approximate matrix multiplication. Inf. Process. Lett., 8(5):234–235, 1979.
  9. Felix A. Behrend. On sets of integers which contain no three terms in arithmetical progression. Proceedings of the National Academy of Sciences of the United States of America, 32(12):331, 1946.
  10. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci., 380(1-2):37–46, 2007.
  11. Don Coppersmith. Rapid multiplication of rectangular matrices. SIAM J. Comput., 11(3):467–471, 1982.
  12. Don Coppersmith. Rectangular matrix multiplication revisited. J. Complex., 13(1):42–49, 1997.
  13. Barriers for fast matrix multiplication from irreversibility. Theory Comput., 17:1–32, 2021.
  14. On the asymptotic complexity of matrix multiplication. SIAM J. Comput., 11(3):472–492, 1982.
  15. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9(3):251–280, 1990.
  16. Improved bound for complexity of matrix multiplication. Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 143:351–369, 4 2013.
  17. Faster matrix multiplication via asymmetric hashing. In Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS), 2023.
  18. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Rev., 47(1):99–131, Jan 2005.
  19. François Le Gall. Faster algorithms for rectangular matrix multiplication. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 514–523, 2012.
  20. François Le Gall. Powers of tensors and fast matrix multiplication. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC), pages 296–303, 2014.
  21. François Le Gall. Faster rectangular matrix multiplication by combination loss analysis. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3765–3791, 2024.
  22. Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1029–1046, 2018.
  23. MATLAB 9.12 (R2022a). The MathWorks Inc., Natick, Massachusetts, 2022.
  24. Victor Y. Pan. Strassen’s algorithm is not optimal: Trililnear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science (FOCS), pages 166–176, 1978.
  25. Francesco Romani. Some properties of disjoint sums of tensors related to matrix multiplication. SIAM J. Comput., pages 263–267, 1982.
  26. Arnold Schönhage. Partial and total matrix multiplication. SIAM J. Comput., 10(3):434–455, 1981.
  27. On sets of integers which contain no three terms in arithmetical progression. Proceedings of the National Academy of Sciences, 28(12):561–563, 1942.
  28. Volker Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354–356, 1969.
  29. Volker Strassen. The asymptotic spectrum of tensors and the exponent of matrix multiplication. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS), pages 49–54, 1986.
  30. Volker Strassen. Relative bilinear complexity and matrix multiplication. J. reine angew. Math. (Crelles Journal), 375–376:406–443, 1987.
  31. All-pairs bottleneck paths in vertex weighted graphs. Algorithmica, 59(4):621–633, 2011.
  32. Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th Symposium on Theory of Computing Conference (STOC), pages 887–898, 2012.
  33. New bounds for matrix multiplication: from alpha to omega. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3792–3835, 2024.
  34. Uri Zwick. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM, 49(3):289–317, 2002.
Citations (6)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now