On Multilinear Forms: Bias, Correlation, and Tensor Rank

04/24/2018
by   Abhishek Bhrushundi, et al.
0

In this paper, we prove new relations between the bias of multilinear forms, the correlation between multilinear forms and lower degree polynomials, and the rank of tensors over GF(2)= {0,1}. We show the following results for multilinear forms and tensors. 1. Correlation bounds : We show that a random d-linear form has exponentially low correlation with low-degree polynomials. More precisely, for d ≪ 2^o(k), we show that a random d-linear form f(X_1,X_2, ..., X_d) : (GF(2)^k)^d → GF(2) has correlation 2^-k(1-o(1)) with any polynomial of degree at most d/10. This result is proved by giving near-optimal bounds on the bias of random d-linear form, which is in turn proved by giving near-optimal bounds on the probability that a random rank-t d-linear form is identically zero. 2. Tensor-rank vs Bias : We show that if a d-dimensional tensor has small rank, then the bias of the associated d-linear form is large. More precisely, given any d-dimensional tensor T :[k]×... [k]_d times→ GF(2) of rank at most t, the bias of the associated d-linear form f_T(X_1,...,X_d) := ∑_(i_1,...,i_d) ∈ [k]^d T(i_1,i_2,..., i_d) X_1,i_1· X_1,i_2... X_d,i_d is at most (1-1/2^d-1)^t. The above bias vs tensor-rank connection suggests a natural approach to proving nontrivial tensor-rank lower bounds for d=3. In particular, we use this approach to prove that the finite field multiplication tensor has tensor rank at least 3.52 k matching the best known lower bound for any explicit tensor in three dimensions over GF(2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2017

Barriers for Rank Methods in Arithmetic Complexity

Arithmetic complexity is considered simpler to understand than Boolean c...
research
04/08/2019

More barriers for rank methods, via a "numeric to symbolic" transfer

We prove new barrier results in arithmetic complexity theory, showing se...
research
10/28/2020

Matrix and tensor rigidity and L_p-approximation

In this note we make two observations. First: the low-rank approximation...
research
11/10/2022

Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials

Suppose we are given an n-dimensional order-3 symmetric tensor T ∈ (ℝ^n)...
research
02/21/2021

An Optimal Inverse Theorem

We prove that the partition rank and the analytic rank of tensors are eq...
research
02/27/2019

An exponential lower bound for the degrees of invariants of cubic forms and tensor actions

Using the Grosshans Principle, we develop a method for proving lower bou...
research
04/07/2015

Tensor machines for learning target-specific polynomial features

Recent years have demonstrated that using random feature maps can signif...

Please sign up or login with your details

Forgot password? Click here to reset