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,...

Full description

Bibliographic Details

Published in:	Applied and computational harmonic analysis Vol. 62; pp. 310 - 330
Main Authors:	Hashemi, Abolfazl, Schaeffer, Hayden, Shi, Robert, Topcu, Ufuk, Tran, Giang, Ward, Rachel
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.01.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!