矩匹配多项式
Moment-Matching Polynomials
摘要:
我们给出了一个新的框架,证明存在的低次,多项式逼近的布尔函数的广泛类的非产品分布。我们的证明使用的技术相关的经典矩问题和偏离显着从已知的傅立叶为基础的方法,这需要底层的分布有一定的产品结构。我们的主要应用是第一多项式时间算法不可知学习任何函数的一个常数的半空间相对于任何对数凹分布(任何恒定的精度参数)。这个结果是不知道的情况下,甚至学习两个半空间的交集没有噪音。此外,我们表明,在“平滑分析”的设置,上述结果保持相对于具有次指数尾部的分布,满足许多自然和充分研究分布在机器学习的属性。鉴于我们的算法可以使用具有多项式核的支持向量机(SVMs)来实现,这些结果给出了严格的理论解释,为什么许多核方法在实践中工作得如此之好。
英文摘要:
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem and deviate significantly from known Fourier-based methods, which require the underlying distribution to have some product structure. Our main application is the first polynomial-time algorithm for agnostically learning any function of a constant number of halfspaces with respect to any log-concave distribution (for any constant accuracy parameter). This result was not known even for the case of learning the intersection of two halfspaces without noise. Additionally, we show that in the "smoothed-analysis" setting, the above results hold with respect to distributions that have sub-exponential tails, a property satisfied by many natural and well-studied distributions in machine learning. Given that our algorithms can be implemented using Support Vector Machines (SVMs) with a polynomial kernel, these results give a rigorous theoretical explanation as to why many kernel methods work so well in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。