有界独立二阶阈值函数
Bounded Independence Fools Degree-2 Threshold Functions
摘要:
设x是来自{-1,1}^n上任意k-独立分布的随机向量。对于n元二次多项式p,证明了E[sgn(p(x))]在k = poly(1/n)的加法上是确定的.这回答了Diakonikolas等人提出的一个未决问题(森林观测和科学委员会,2009年)。使用标准构造的k-wise独立分布,我们得到了广泛的一类显式生成器,ε-愚弄类的度-2阈值函数与种子长度log(n)*poly(1/n)。我们的方法非常强大:它很容易扩展以产生任何常数数量的2次阈值函数的交集被poly(1/n)-明智的独立性所愚弄。我们的结果也成立,如果x的条目是k-独立的标准法线,这意味着例如,有界的独立性去随机化的Goemans-Williamson超平面舍入方案。为了实现我们的结果,我们引入了一种技术,我们称之为多变量FT-软化,这是Kane等人(SODA 2010)在流算法上下文中引入的单变量形式的推广。一路上,我们证明了一个广义超压缩不等式的二次型,其中考虑到相关矩阵的运营商范数。这些技术可能是独立的利益。
英文摘要:
Let x be a random vector coming from any k-wise independent distribution over {-1,1}^n. For an n-variate degree-2 polynomial p, we prove that E[sgn(p(x))] is determined up to an additive epsilon for k = poly(1/epsilon). This answers an open question of Diakonikolas et al. (FOCS 2009). Using standard constructions of k-wise independent distributions, we obtain a broad class of explicit generators that epsilon-fool the class of degree-2 threshold functions with seed length log(n)*poly(1/epsilon). Our approach is quite robust: it easily extends to yield that the intersection of any constant number of degree-2 threshold functions is epsilon-fooled by poly(1/epsilon)-wise independence. Our results also hold if the entries of x are k-wise independent standard normals, implying for example that bounded independence derandomizes the Goemans-Williamson hyperplane rounding scheme. To achieve our results, we introduce a technique we dub multivariate FT-mollification, a generalization of the univariate form introduced by Kane et al. (SODA 2010) in the context of streaming algorithms. Along the way we prove a generalized hypercontractive inequality for quadratic forms which takes the operator norm of the associated matrix into account. These techniques may be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。