Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyond

The class of random features is one of the most popular techniques to speed up kernel methods in large-scale problems. Related works have been recognized by the NeurIPS Test-of-Time award in 2017 and the ICML Best Paper Finalist in 2019. The body of work on random features has grown rapidly, and hen...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on pattern analysis and machine intelligence Ročník 44; číslo 10; s. 7128 - 7148
Hlavní autoři:	Liu, Fanghui, Huang, Xiaolin, Chen, Yudong, Suykens, Johan A. K.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.10.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Approximation Approximation algorithms Artificial neural networks Empirical analysis generalization properties Kernel kernel approximation Kernels Loss measurement Machine learning Mathematical analysis over-parameterized models Prediction algorithms Random features Risk management Scalability Taxonomy
ISSN:	0162-8828, 1939-3539, 2160-9292, 1939-3539
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!