Random Fourier Features (RFF) demonstrate wellappreciated performance in kernel approximation for largescale situations but restrict kernels to be stationary and positive definite. And for non-stationary kernels, the corresponding RFF could be converted to that for stationary indefinite kernels when the inputs are restricted to the unit sphere. Numerous methods provide accessible ways to approximate stationary but indefinite kernels. However, they are either biased or possess large variance. In this article, we propose the generalized orthogonal random features, an unbiased estimation with lower variance.Experimental results on various datasets and kernels verify that our algorithm achieves lower variance and approximation error compared with the existing kernel approximation methods. With better approximation to the originally selected kernels, improved classification accuracy and regression ability is obtained with our approximation algorithm in the framework of support vector machine and regression.
翻译:随机四面形地貌( RFF) 显示大规模情况下内核近似接近内核的良好表现,但限制内核是固定的和肯定的。 对于非静止的内核,当输入限于单位范围时,相应的RF可转换成固定的无固定内核。许多方法为大约固定但无限期的内核提供了方便的方法。但是,它们要么有偏向性,要么有很大的差异。在本篇文章中,我们提出了通用的或远的随机特性,一个不偏袒的、差异较小的估计。关于各种数据集和内核的实验结果可以证实我们的算法与现有的内核近似方法相比,差异和近似错误较小。如果与最初选定的内核更加接近,那么在支持矢量机和回归的框架中,我们的近似算法可以提高分类的准确性和回归能力。