# Finding small sets of random fourier features for shift-invariant kernel approximation

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Standard

**Finding small sets of random fourier features for shift-invariant kernel approximation.** / Schleif, Frank M.; Kaban, Ata; Tino, Peter.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Harvard

*Artificial Neural Networks in Pattern Recognition - 7th IAPR TC3 Workshop, ANNPR 2016, Proceedings.*vol. 9896 LNAI, Lecture Notes in Computer Science, vol. 9896 LNAI, Springer Verlag, pp. 42-54, 7th IAPR TC3 Workshop on Artificial Neural Networks in Pattern Recognition, ANNPR 2016, Ulm, Germany, 28/09/16. https://doi.org/10.1007/978-3-319-46182-3_4

## APA

*Artificial Neural Networks in Pattern Recognition - 7th IAPR TC3 Workshop, ANNPR 2016, Proceedings*(Vol. 9896 LNAI, pp. 42-54). (Lecture Notes in Computer Science; Vol. 9896 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-319-46182-3_4

## Vancouver

## Author

## Bibtex

}

## RIS

TY - GEN

T1 - Finding small sets of random fourier features for shift-invariant kernel approximation

AU - Schleif, Frank M.

AU - Kaban, Ata

AU - Tino, Peter

PY - 2016/9/9

Y1 - 2016/9/9

N2 - Kernel based learning is very popular in machine learning, but many classical methods have at least quadratic runtime complexity. Random fourier features are very effective to approximate shift-invariant kernels by an explicit kernel expansion. This permits to use efficient linear models with much lower runtime complexity. As one key approach to kernelize algorithms with linear models they are successfully used in different methods. However, the number of features needed to approximate the kernel is in general still quite large with substantial memory and runtime costs. Here, we propose a simple test to identify a small set of random fourier features with linear costs, substantially reducing the number of generated features for low rank kernel matrices, while widely keeping the same representation accuracy. We also provide generalization bounds for the proposed approach.

AB - Kernel based learning is very popular in machine learning, but many classical methods have at least quadratic runtime complexity. Random fourier features are very effective to approximate shift-invariant kernels by an explicit kernel expansion. This permits to use efficient linear models with much lower runtime complexity. As one key approach to kernelize algorithms with linear models they are successfully used in different methods. However, the number of features needed to approximate the kernel is in general still quite large with substantial memory and runtime costs. Here, we propose a simple test to identify a small set of random fourier features with linear costs, substantially reducing the number of generated features for low rank kernel matrices, while widely keeping the same representation accuracy. We also provide generalization bounds for the proposed approach.

U2 - 10.1007/978-3-319-46182-3_4

DO - 10.1007/978-3-319-46182-3_4

M3 - Conference contribution

AN - SCOPUS:84987935094

SN - 9783319461816

VL - 9896 LNAI

T3 - Lecture Notes in Computer Science

SP - 42

EP - 54

BT - Artificial Neural Networks in Pattern Recognition - 7th IAPR TC3 Workshop, ANNPR 2016, Proceedings

PB - Springer Verlag

T2 - 7th IAPR TC3 Workshop on Artificial Neural Networks in Pattern Recognition, ANNPR 2016

Y2 - 28 September 2016 through 30 September 2016

ER -