Document Open Access Logo

Matrix Multiplication Reductions

Authors Ashish Gola, Igor Shinkar , Harsimran Singh

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2024.34.pdf
  • Filesize: 0.74 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Matrix Multiplication
  • Reductions
  • Worst case to average case reductions

Metrics

Abstract

In this paper we study a worst case to average case reduction for the problem of matrix multiplication over finite fields. Suppose we have an efficient average case algorithm, that given two random matrices A,B outputs a matrix that has a non-trivial correlation with their product A ⋅ B. Can we transform it into a worst case algorithm, that outputs the correct answer for all inputs without incurring a significant overhead in the running time? We present two results in this direction.
- Two-sided error in the high agreement regime. We begin with a brief remark about a reduction for high agreement algorithms, i.e., an algorithm which agrees with the correct output on a large (say > 0.9) fraction of entries, and show that the standard self-correction of linearity allows us to transform such algorithms into algorithms that work in worst case.
- One-sided error in the low agreement regime. Focusing on average case algorithms with one-sided error, we show that over 𝔽₂ there is a reduction that gets an O(T) time average case algorithm that given a random input A,B outputs a matrix that agrees with A ⋅ B on at least 51% of the entries (i.e., has only a slight advantage over the trivial algorithm), and transforms it into an Õ(T) time worst case algorithm, that outputs the correct answer for all inputs with high probability.

Cite As Get BibTex

Ashish Gola, Igor Shinkar, and Harsimran Singh. Matrix Multiplication Reductions. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.34

Author Details

Ashish Gola
  • Simon Fraser University, Burnaby, Canada
Igor Shinkar
  • Simon Fraser University, Burnaby, Canada
Harsimran Singh
  • Simon Fraser University, Burnaby, Canada

Acknowledgements

We are grateful to the anonymous referees for their helpful comments. We also thank Sasha Golovnev and Tom Gur for their valuable feedback.

References

  1. Josh Alman and Virginia Vassilevska Williams. A refined laser method and faster matrix multiplication. In SODA 2021, pages 522-539. SIAM, 2021. Google Scholar
  2. Vahid R. Asadi, Alexander Golovnev, Tom Gur, and Igor Shinkar. Worst-case to average-case reductions via additive combinatorics. In STOC 2022, pages 00-00. ACM, 2022. Google Scholar
  3. Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, and Sathyawageeswar Subramanian. Quantum Worst-Case to Average-Case Reductions for All Linear Problems, pages 2535-2567. Society for Industrial and Applied Mathematics, 2024. URL: https://doi.org/10.1137/1.9781611977912.90.
  4. Shai Ben-David, Benny Chor, Oded Goldreich, and Michel Luby. On the theory of average case complexity. Journal of Computer and System Sciences, 44(2):193-219, 1992. URL: https://doi.org/10.1016/0022-0000(92)90019-F.
  5. Dario Bini, Milvio Capovani, Francesco Romani, and Grazia Lotti. O(n2.7799) complexity for n × n approximate matrix multiplication. Information Processing Letters, 8(5):234-235, 1979. URL: https://doi.org/10.1016/0020-0190(79)90113-3.
  6. Manuel Blum, Michael Luby, and Ronitt Rubinfeld. Self-testing/correcting with applications to numerical problems. In STOC 1990, pages 73-83. ACM, 1990. Google Scholar
  7. Andrej Bogdanov and Luca Trevisan. Average-case complexity. Found. Trends Theor. Comput. Sci., 2(1):1-106, October 2006. URL: https://doi.org/10.1561/0400000004.
  8. Mei-Chu Chang. A polynomial bound in Freiman’s theorem. Duke Mathematical Journal, 113(3):399-419, 2002. URL: https://doi.org/10.1215/S0012-7094-02-11331-3.
  9. Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, 1990. Computational algebraic complexity editorial. URL: https://doi.org/10.1016/S0747-7171(08)80013-2.
  10. Ran Duan, Hongxun Wu, and Renfei Zhou. Faster matrix multiplication via asymmetric hashing. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 2129-2138. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00130.
  11. Leszek Ga̧sieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, and Takeshi Tokuyama. Efficiently correcting matrix products. Algorithmica, 79(2):428-443, October 2017. URL: https://doi.org/10.1007/s00453-016-0202-3.
  12. Oded Goldreich, editor. Studies in complexity and cryptography: miscellanea on the interplay between randomness and computation. Springer-Verlag, Berlin, Heidelberg, 2011. Google Scholar
  13. Shuichi Hirahara and Nobutaka Shimizu. Hardness self-amplification: Simplified, optimized, and unified. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 70-83. Association for Computing Machinery, 2023. URL: https://doi.org/10.1145/3564246.3585189.
  14. Russell Impagliazzo. A personal view of average-case complexity. Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference, pages 134-147, 1995. URL: https://api.semanticscholar.org/CorpusID:2154064.
  15. Russell Impagliazzo. Relativized separations of worst-case and average-case complexities for NP. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pages 104-114. IEEE Computer Society, 2011. URL: https://doi.org/10.1109/CCC.2011.34.
  16. Russell Impagliazzo and Leonid A. Levin. No better ways to generate hard NP instances than picking uniformly at random. In 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pages 812-821. IEEE Computer Society, 1990. URL: https://doi.org/10.1109/FSCS.1990.89604.
  17. François Le Gall. Powers of tensors and fast matrix multiplication. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pages 296-303, New York, NY, USA, 2014. Association for Computing Machinery. URL: https://doi.org/10.1145/2608628.2608664.
  18. Leonid A. Levin. Average case complete problems. SIAM Journal on Computing, 15(1):285-286, 1986. URL: https://doi.org/10.1137/0215020.
  19. V. Ya. Pan. Strassen’s algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In 19th Annual Symposium on Foundations of Computer Science (SFCS 1978), pages 166-176, 1978. URL: https://doi.org/10.1109/SFCS.1978.34.
  20. Francesco Romani. Some properties of disjoint sums of tensors related to matrix multiplication. SIAM Journal on Computing, 11(2):263-267, 1982. URL: https://doi.org/10.1137/0211020.
  21. A. Schönhage. Partial and total matrix multiplication. SIAM Journal on Computing, 10(3):434-455, 1981. URL: https://doi.org/10.1137/0210032.
  22. Andrew James Stothers. On the complexity of matrix multiplication. In University of Edinburgh, 2010. URL: https://api.semanticscholar.org/CorpusID:262795811.
  23. V. Strassen. The asymptotic spectrum of tensors and the exponent of matrix multiplication. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pages 49-54, 1986. URL: https://doi.org/10.1109/SFCS.1986.52.
  24. Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13(4):354-356, 1969. Google Scholar
  25. Virginia Vassilevska Williams. Multiplying matrices faster than coppersmith-winograd. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC '12, pages 887-898, New York, NY, USA, 2012. Association for Computing Machinery. URL: https://doi.org/10.1145/2213977.2214056.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact