Bounds on complexity of matrix multiplication away from CW tensors

03/23/2021
by   Roser Homs, et al.
0

We present three families of minimal border rank tensors: they come from highest weight vectors, smoothable algebras, or monomial algebras. We analyse them using Strassen's laser method and obtain an upper bound 2.431 on ω. We also explain how in certain monomial cases using the laser method directly is less profitable than first degenerating. Our results form possible paths in the search for valuable tensors for the laser method away from Coppersmith-Winograd tensors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2020

A Refined Laser Method and Faster Matrix Multiplication

The complexity of matrix multiplication is measured in terms of ω, the s...
research
09/10/2019

Kronecker powers of tensors and Strassen's laser method

We answer a question, posed implicitly by Coppersmith-Winogrand and Buer...
research
09/23/2020

Bad and good news for Strassen's laser method: Border rank of the 3x3 permanent and strict submultiplicativity

We determine the border ranks of tensors that could potentially advance ...
research
10/04/2021

Irreversibility of Structure Tensors of Modules

Determining the matrix multiplication exponent ω is one of the greatest ...
research
09/20/2019

Tensors with maximal symmetries

We classify tensors with maximal and next to maximal dimensional symmetr...
research
12/20/2018

Limits on the Universal Method for Matrix Multiplication

In a recent work, Alman and Vassilevska Williams [FOCS 2018, arXiv:1810....
research
12/28/2020

Weighted Slice Rank and a Minimax Correspondence to Strassen's Spectra

Structural and computational understanding of tensors is the driving for...

Please sign up or login with your details

Forgot password? Click here to reset