TY - GEN
T1 - On multilinear forms
T2 - 23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 24th International Conference on Randomization and Computation, APPROX/RANDOM 2020
AU - Bhrushundi, Abhishek
AU - Harsha, Prahladh
AU - Hatami, Pooya
AU - Kopparty, Swastik
AU - Kumar, Mrinal
N1 - Publisher Copyright:
© 2020 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
PY - 2020/8/1
Y1 - 2020/8/1
N2 - In this work, we prove new relations between the bias of multilinear forms, the correlation between multilinear forms and lower degree polynomials, and the rank5 of tensors over F2. We show the following results for multilinear forms and tensors. Correlation bounds. We show that a random d-linear form has exponentially low correlation with low-degree polynomials. More precisely, for d = 2o(k), we show that a random d-linear form f(X1, X2,..., Xd): (Fk2)d → F2 has correlation 2−k(1−o(1)) with any polynomial of degree at most d/2 with high probability. This result is proved by giving near-optimal bounds on the bias of a random d-linear form, which is in turn proved by giving near-optimal bounds on the probability that a sum of t random d-dimensional rank-1 tensors is identically zero. Tensor rank vs Bias. We show that if a 3-dimensional tensor has small rank then its bias, when viewed as a 3-linear form, is large. More precisely, given any 3-dimensional tensor T: [k]3 → F2 of rank at most t, the bias of the 3-linear form fT(X1,X2,X3):= T(i1, i2, i3) · X1,i1 · X2,i2 · X3,i3 (i1,i2,i3)∈[k]3 is at least (3/4)t. This bias vs tensor-rank connection suggests a natural approach to proving nontrivial tensor-rank lower bounds. In particular, we use this approach to give a new proof that the finite field multiplication tensor has tensor rank at least 3.52k, which is the best known rank lower bound for any explicit tensor in three dimensions over F2. Moreover, this relation between bias and tensor rank holds for d-dimensional tensors for any fixed d.
AB - In this work, we prove new relations between the bias of multilinear forms, the correlation between multilinear forms and lower degree polynomials, and the rank5 of tensors over F2. We show the following results for multilinear forms and tensors. Correlation bounds. We show that a random d-linear form has exponentially low correlation with low-degree polynomials. More precisely, for d = 2o(k), we show that a random d-linear form f(X1, X2,..., Xd): (Fk2)d → F2 has correlation 2−k(1−o(1)) with any polynomial of degree at most d/2 with high probability. This result is proved by giving near-optimal bounds on the bias of a random d-linear form, which is in turn proved by giving near-optimal bounds on the probability that a sum of t random d-dimensional rank-1 tensors is identically zero. Tensor rank vs Bias. We show that if a 3-dimensional tensor has small rank then its bias, when viewed as a 3-linear form, is large. More precisely, given any 3-dimensional tensor T: [k]3 → F2 of rank at most t, the bias of the 3-linear form fT(X1,X2,X3):= T(i1, i2, i3) · X1,i1 · X2,i2 · X3,i3 (i1,i2,i3)∈[k]3 is at least (3/4)t. This bias vs tensor-rank connection suggests a natural approach to proving nontrivial tensor-rank lower bounds. In particular, we use this approach to give a new proof that the finite field multiplication tensor has tensor rank at least 3.52k, which is the best known rank lower bound for any explicit tensor in three dimensions over F2. Moreover, this relation between bias and tensor rank holds for d-dimensional tensors for any fixed d.
KW - Bias
KW - Boolean functions
KW - Correlation
KW - Polynomials
KW - Tensor rank
UR - http://www.scopus.com/inward/record.url?scp=85091274150&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091274150&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.APPROX/RANDOM.2020.29
DO - 10.4230/LIPIcs.APPROX/RANDOM.2020.29
M3 - Conference contribution
AN - SCOPUS:85091274150
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020
A2 - Byrka, Jaroslaw
A2 - Meka, Raghu
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Y2 - 17 August 2020 through 19 August 2020
ER -