The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Powers of tensors and fast matrix multiplication
Abstract
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic construction also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with existing approaches, this method is based on convex optimization, and thus has polynomial-time complexity. As an application, we use this method to study powers of the construction given by Coppersmith and Winograd [Journal of Symbolic Computation, 1990] and obtain the upper bound ω < 2.3728639 on the exponent of square matrix multiplication, which slightly improves the best known upper bound.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Bürgisser, P., Clausen, M., & Shokrollahi, M. A. (1997) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03338-8 · Cited by 1,026
Multiplying matrices faster than coppersmith-winograd
Williams, V. V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214056 · Cited by 850
Partial and Total Matrix Multiplication
Schönhage, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210032 · Cited by 259
Group-theoretic Algorithms for Matrix Multiplication
Cohn, H., Kleinberg, R., Szegedy, B., & Umans, C. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.39 · Cited by 201
On the complexity of matrix multiplication
Stothers, A. J. (2010) · ERA · Cited by 167
Improved bound for complexity of matrix multiplication
Davie, A. M., & Stothers, A. J. (2013) · Proceedings of the Royal Society of Edinburgh: Section A Mathematics · doi:10.1017/s0308210511001648 · Cited by 152
The asymptotic spectrum of tensors and the exponent of matrix multiplication
Strassen, V. (1986) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1986.52 · Cited by 120
On Sunflowers and Matrix Multiplication
Alon, N., Shpilka, A., & Umans, C. (2012) · Computational Complexity · doi:10.1007/s00037-013-0060-1 · Cited by 99
Fast matrix multiplication using coherent configurations
Cohn, H., & Umans, C. (2013) · Cited by 33
Cited by
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Discovering faster matrix multiplication algorithms with reinforcement learning
Fawzi, A., Balog, M., Huang, A., Hubert, T., Romera-Paredes, B., Barekatain, M., Novikov, A., R. Ruiz, F. J., Schrittwieser, J., Swirszcz, G., et al. (2022) · Nature · doi:10.1038/s41586-022-05172-4 · Cited by 478
A Robust Regularization Path Algorithm for $\nu $ -Support Vector Classification
Gu, B., & Sheng, V. S. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2527796 · Cited by 449
Why Does Deep and Cheap Learning Work So Well?
Lin, H. W., Tegmark, M., & Rolnick, D. (2017) · Journal of Statistical Physics · doi:10.1007/s10955-017-1836-5 · Cited by 393
A Refined Laser Method and Faster Matrix Multiplication
Alman, J., & Williams, V. V. (2021) · Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611976465.32 · Cited by 268
Metadata
- Authors
- Le Gall, F.
- Venue
- Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation
- Publisher
- ACM
- Published
- 2014-07-23
- Pages
- 296-303
- OpenAlex
- W2120248756
- Cited by
- 856
- References
- 12
- FWCI
- 60.19
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.