紧非线性映射与循环扩张
Compact Nonlinear Maps and Circulant Extensions
摘要:
通过非线性随机特征映射的核近似被广泛用于加速核机器。传统的核近似方法面临两个主要挑战。首先,在执行核近似之前,必须选择一个好的核。选择一个好的内核本身就是一个非常具有挑战性的问题。其次,为了获得良好的性能,通常需要高维映射。这导致在生成非线性映射以及随后的学习和预测过程中的高计算成本。在这项工作中,我们建议优化的非线性映射直接相对于分类目标的数据依赖的方式。该方法实现了核近似和核学习的联合框架。这会导致更紧凑的地图,而不会影响性能。作为一个副产品,同样的框架也可以用来实现更紧凑的内核映射,以近似一个已知的内核。我们还介绍了循环非线性映射,它使用循环结构的投影矩阵来加速高维数据的非线性映射。
英文摘要:
Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good kernel has to be chosen. Picking a good kernel is a very challenging problem in itself. Second, high-dimensional maps are often required in order to achieve good performance. This leads to high computational cost in both generating the nonlinear maps, and in the subsequent learning and prediction process. In this work, we propose to optimize the nonlinear maps directly with respect to the classification objective in a data-dependent fashion. The proposed approach achieves kernel approximation and kernel learning in a joint framework. This leads to much more compact maps without hurting the performance. As a by-product, the same framework can also be used to achieve more compact kernel maps to approximate a known kernel. We also introduce Circulant Nonlinear Maps, which uses a circulant-structured projection matrix to speed up the nonlinear maps for high-dimensional data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。