Random Fourier Features

Random Fourier Features is a kernel approximation method that maps input data into a randomized low-dimensional Euclidean space by sampling from the Fourier transform of a shift-invariant kernel, thereby enabling scalable kernel learning through explicit feature representations.

112

Publications

3.9K

Citations

314

Authors

153

Institutions

Publications per year

2017–2026

85

Variants

Rff

Authors

314

  1. RM
    Rangeet Mitra

    Indian Institute of Technology Indore, India

    7 publications · 165 citations

    7

    h-index

  2. VB
    Vimal Bhatia

    Indian Institute of Technology Indore, India

    6 publications · 142 citations

    6

    h-index

  3. SW
    Shiyuan Wang

    Southwest University, China

    6 publications · 242 citations

    6

    h-index

  4. SJ
    Sandesh Jain

    Indian Institute of Technology Indore, India

    5 publications · 115 citations

    5

    h-index

  5. SW
    Stefan Werner

    Aalto University, Finland

    5 publications · 101 citations

    5

    h-index

1–5 of 314

Venues

  1. arXiv (Cornell University)

    Repository · 26 publications · 744 citations

    16

    h-index

  2. IEEE Transactions on Signal Processing

    5 publications · 201 citations

    5

    h-index

  3. Neural Information Processing Systems

    Conference · 4 publications · 114 citations

    4

    h-index

  4. 3

    h-index

  5. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 3 publications · 48 citations

    3

    h-index

1–5