两个半空间的相交具有很高的阈值度
The intersection of two halfspaces has high threshold degree
摘要:
布尔函数f:{0,1}^n->{-1,+1}的阈值次数是实多项式p使得f(x)=sgn p(x)的最小次数。我们在{0,1}^n上构造两个半空间,它们的交集具有阈值度Theta(sqrt n),这是对以前下界的指数改进。这解决了Klivans(2002)提出的一个开放问题,并排除了使用基于感知器的技术来学习两个半空间的交集,这是计算学习中一个尚未解决的核心挑战。我们还证明了两个多数函数的交集具有阈值度Ω(log n),这是紧的,解决了O 'Donnell和Servedio(2003)的一个猜想.我们的证明由两部分组成。首先,我们证明了对于任意非常数布尔函数f和g,交集f(x)^g(y)具有阈值度O(d)当且仅当||f-F||_infty +|| g-G||_infty < 1,对于某些O(d)次有理函数F,G.其次,我们解决了所需的最低程度逼近半空间和多数功能,以任何给定的精度由有理函数。我们的技术进一步使我们能够在Aaronson的挑战(2008)上取得进展,并为形式为F(f_1,...,f_n)。特别地,我们给出了与或树的近似度的一个改进下界。
英文摘要:
The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential improvement on previous lower bounds. This solves an open problem due to Klivans (2002) and rules out the use of perceptron-based techniques for PAC learning the intersection of two halfspaces, a central unresolved challenge in computational learning. We also prove that the intersection of two majority functions has threshold degree Omega(log n), which is tight and settles a conjecture of O'Donnell and Servedio (2003). Our proof consists of two parts. First, we show that for any nonconstant Boolean functions f and g, the intersection f(x)^g(y) has threshold degree O(d) if and only if ||f-F||_infty + ||g-G||_infty < 1 for some rational functions F, G of degree O(d). Second, we settle the least degree required for approximating a halfspace and a majority function to any given accuracy by rational functions. Our technique further allows us to make progress on Aaronson's challenge (2008) and contribute strong direct product theorems for polynomial representations of composed Boolean functions of the form F(f_1,...,f_n). In particular, we give an improved lower bound on the approximate degree of the AND-OR tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。