ML p(r)ior | On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry

On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry

2016-01-29
1601.08229 | math.AG
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the determinant polynomial) come in families that include representatives with normal forms. These normal forms will be useful both to develop new efficient algorithms and to prove lower complexity bounds. We derive a border rank version of the substitution method used in proving lower bounds for tensor rank. We use this border-substitution method and a normal form to improve the lower bound on the border rank of matrix multiplication by one, to 2n^2- n+1. We also point out difficulties that will be formidable obstacles to future progress on lower complexity bounds for tensors because of the "wild" structure of the Hilbert scheme of points.

Highlights - Most important sentences from the article

Related Articles

2015-06-01
1506.00575 | math.OC

We propose a new algorithm to solve optimization problems of the form $\min f(X)$ for a smooth funct… show more

Highlights - Most important sentences from the article

2019-05-24
1905.10192 | cs.SC

It is known since the 1970s that no more than 23 multiplications are required for computing the prod… show more

Highlights - Most important sentences from the article

2018-07-17
1807.06194 | cs.DS

Given nonnegative integers $n$ and $d$, where $n \gg d$, what is the minimum number $r$ such that th… show more

Highlights - Most important sentences from the article

2019-04-10
1904.05227 | cs.IT

We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We defi… show more

Highlights - Most important sentences from the article

2019-05-10
1905.04124 | cs.DS

Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data ana… show more

Highlights - Most important sentences from the article

2016-08-08
1608.02530 | math.AG

Young flattenings, introduced by Landsberg and Ottaviani, give determinantal equations for secant va… show more

Highlights - Most important sentences from the article

2019-04-08
1904.04299 | cs.CC

We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural … show more

Highlights - Most important sentences from the article

2019-02-11
1902.03950 | cs.CC

Highlights - Most important sentences from the article

2017-05-10
1705.03866 | cs.CC

We answer a question of K. Mulmuley: In [Efremenko-Landsberg-Schenck-Weyman] it was shown that the m… show more

Highlights - Most important sentences from the article

2018-10-12
1810.05559 | math.AG

We present algorithms for reconstructing, up to unavoidable projective automorphisms, surfaces with … show more

Highlights - Most important sentences from the article

2018-10-12
1810.05440 | cs.LG

Shuffled linear regression is the problem of performing a linear regression fit to a dataset for whi… show more

Highlights - Most important sentences from the article

2018-11-13
1811.05511 | math.AG

We establish basic information about the set of tight tensors, the tensors with continuous regular s… show more

Highlights - Most important sentences from the article

2018-01-25
1801.08407 | cs.IT

We define a linear code $C_\eta(\delta_T,\delta_X)$ by evaluating polynomials of bidegree \$(\delta_T… show more

Highlights - Most important sentences from the article

2018-10-30
1810.12588 | cs.SC

Symmetric tensor decomposition is an important problem with applications in several areas for exampl… show more

Highlights - Most important sentences from the article

2019-03-31
1904.00357 | cs.IT

We introduce a new family of rank metric codes: Low Rank Parity Check codes (LRPC), for which we pro… show more

Highlights - Most important sentences from the article

2018-04-05
1804.01796 | math.OC