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

核特征的高斯求积

Gaussian Quadrature for Kernel Features

Stanford University(斯坦福大学);Cornell University(康奈尔大学)

Tri Dao, Christopher De Sa, Christopher Ré

摘要:

核方法最近重新引起了人们的兴趣,在语音识别等任务中表现出与深度神经网络竞争的性能。随机傅立叶特征图是一种通常用于放大内核机器的技术,但是采用随机化特征图意味着需要$O(ε^{-2})$样本来实现至多$ε$的近似误差。我们研究了一些替代方案,用于构建确定性的特征映射,而不是随机的,在频域中使用高斯正交近似的内核。我们表明,确定性特征映射可以构建,对于任何$γ> 0$,实现错误的$ε$与$O(e^{e^γ} + ε^{-1/γ})$样本作为$ε$去0。我们的方法特别适合稀疏ANOVA内核,它受到CNN卷积层的启发。我们在不同领域的数据集上验证了我们的方法,如MNIST和TIMIT,表明确定性特征的生成速度更快,并且与基于随机傅立叶特征的最先进的内核方法相比,其精度更高。

英文摘要:

Kernel methods have recently attracted resurgent interest, showing performance competitive with deep neural networks in tasks such as speech recognition. The random Fourier features map is a technique commonly used to scale up kernel machines, but employing the randomized feature map means that $O(ε^{-2})$ samples are required to achieve an approximation error of at most $ε$. We investigate some alternative schemes for constructing feature maps that are deterministic, rather than random, by approximating the kernel in the frequency domain using Gaussian quadrature. We show that deterministic feature maps can be constructed, for any $γ> 0$, to achieve error $ε$ with $O(e^{e^γ} + ε^{-1/γ})$ samples as $ε$ goes to 0. Our method works particularly well with sparse ANOVA kernels, which are inspired by the convolutional layer of CNNs. We validate our methods on datasets in different domains, such as MNIST and TIMIT, showing that deterministic features are faster to generate and achieve accuracy comparable to the state-of-the-art kernel methods based on random Fourier features.

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

↑