Sparse Random Feature Algorithm as Coordinate Descent in Hilbert Space

Ian En-Hsu Yen, Ting-Wei Lin, Shou-De Lin, Pradeep K. Ravikumar, Inderjit S. Dhillon

–Neural Information Processing Systems 

In our experiments, the Sparse Random Feature algorithm obtains a sparse solution that requires less memory and prediction time, while maintaining comparable performance on regression and classification tasks.

Neural Information Processing Systems

Feb-9-2025, 02:09:12 GMT

Conferences    PDF

Add feedback

Duplicate Docs Excel Report

Title
Sparse Random Feature Algorithm as Coordinate Descent in Hilbert Space
Sparse Random Features Algorithm as Coordinate Descent in Hilbert Space Shou-De Lin
Sparse Random Feature Algorithm as Coordinate Descent in Hilbert Space

Similar Docs  Excel Report  more

TitleSimilaritySource
None found