首页> 外文期刊>Electronic Colloquium on Computational Complexity >On Multilinear Forms: Bias, Correlation, and Tensor Rank
【24h】

On Multilinear Forms: Bias, Correlation, and Tensor Rank

机译:关于多线性形式:偏差,相关性和张量等级

获取原文
           

摘要

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 G F (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 ) : G F (2 ) k d G F (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 G F (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 least 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 G F (2) .
机译:在本文中,我们证明了多线性形式的偏差,多线性形式和低阶多项式之间的相关性以及G F(2)= 0 1上的张量的秩之间的新关系。我们给出了多线性形式和张量的以下结果:1。相关范围:我们证明,随机d线性形式与低阶多项式具有指数级的低相关性。更准确地说,对于d 2 o(k),我们表明,随机d线性形式f(X 1 X 2 X d):G F(2)k d G F(2)具有相关系数2? k(1?o(1))的任意多项式最多为d 10。该结果通过对随机d线性形式的偏差给出近最佳界限来证明,而这又通过对随机秩t d线性形式相等为零的概率给出近最佳界限来证明。 2. Tensor-rank与Bias:我们证明,如果d维张量的秩较小,则相关的d线性形式的偏差就会很大。更准确地说,给定任何d维张量T:[k] [k] d乘以等级t的GF(2)最多t,相关的d线性形式f T(X 1 X d):=( 1 id)[k] d T(i 1 i 2 id)X 1 i 1 X 1 i 2 X至少是1? 1 2天? 1吨上面的偏差与张量秩之间的联系表明了一种自然的方法来证明d = 3的非平凡的张量秩下界。特别地,我们使用这种方法来证明有限域乘法张量具有至少3 52 k的张量等级,该张量与在G F(3)上的三个维度上任何显式张量的最著名的下限相匹配。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号