Generalization bounds for sparse random feature expansions

Random feature methods have been successful in various machine learning tasks, are easy to compute, and come with theoretical accuracy bounds. They serve as an alternative approach to standard neural networks since they can represent similar function spaces without a costly training phase. However,...

Celý popis

Podrobná bibliografie

Vydáno v:	Applied and computational harmonic analysis Ročník 62; s. 310 - 330
Hlavní autoři:	Hashemi, Abolfazl, Schaeffer, Hayden, Shi, Robert, Topcu, Ufuk, Tran, Giang, Ward, Rachel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.01.2023
Témata:	Compressive sensing Generalization error Random features Sparse optimization Sparse optimization Compressive sensing Random features 60B20 Generalization error 65D15 68Q32 46N10
ISSN:	1063-5203, 1096-603X
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!