Orlicz Random Fourier Features - Archive ouverte HAL Access content directly
Journal Articles Journal of Machine Learning Research Year : 2020

Orlicz Random Fourier Features


Kernel techniques are among the most widely-applied and influential tools in machine learning with applications at virtually all areas of the field. To combine this expressive power with computational efficiency numerous randomized schemes have been proposed in the literature, among which probably random Fourier features (RFF) are the simplest and most popular. While RFFs were originally designed for the approximation of kernel values, recently they have been adapted to kernel derivatives, and hence to the solution of large-scale tasks involving function derivatives. Unfortunately, the understanding of the RFF scheme for the approximation of higher-order kernel derivatives is quite limited due to the challenging polynomial growing nature of the underlying function class in the empirical process. To tackle this difficulty, we establish a finite-sample deviation bound for a general class of polynomial-growth functions under α-exponential Orlicz condition on the distribution of the sample. Instantiating this result for RFFs, our finite-sample uniform guarantee implies a.s. convergence with tight rate for arbitrary kernel with α-exponential Orlicz spectrum and any order of derivative.
Fichier principal
Vignette du fichier
19-1031.pdf (641.02 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02418576 , version 1 (18-12-2019)
hal-02418576 , version 2 (19-06-2020)


  • HAL Id : hal-02418576 , version 2


Linda Chamakh, Emmanuel Gobet, Zoltán Szabó. Orlicz Random Fourier Features. Journal of Machine Learning Research, 2020, 21 (145), pp.1−37. ⟨hal-02418576v2⟩
305 View
149 Download


Gmail Mastodon Facebook X LinkedIn More