arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0910.4224cs.CC
收藏

用多项式表示两个半空间交的符号的最佳界

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials

Alexander A. Sherstov

摘要:

函数f:{0,1}^n->{-1,+1}的阈值次数是实多项式p的最小次数,其中f(x)=sgn p(x)。证明了{0,1}^n上两个半空间的交有阈值度Omega(n),它与平凡上界相匹配,完全回答了Klivans(2002)提出的一个问题.最好的前一个下界是Omega(sqrt n)。我们的结果表明,在{0,1}^n上的两个半空间的交集只允许一个平凡的2^{Theta(n)}-时间学习算法基于符号表示的多项式,不同于PAC学习DNF公式和只读布尔公式所取得的进展。证明引入了一种新的技术,独立的利益,基于傅立叶分析和矩阵理论。

英文摘要:

The threshold degree of a function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p with f(x)=sgn p(x). We prove that the intersection of two halfspaces on {0,1}^n has threshold degree Omega(n), which matches the trivial upper bound and completely answers a question due to Klivans (2002). The best previous lower bound was Omega(sqrt n). Our result shows that the intersection of two halfspaces on {0,1}^n only admits a trivial 2^{Theta(n)}-time learning algorithm based on sign-representation by polynomials, unlike the advances achieved in PAC learning DNF formulas and read-once Boolean formulas. The proof introduces a new technique of independent interest, based on Fourier analysis and matrix theory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑