NobleBlocks
Public

Memory Efficient Kernel Approximation

Published • Jun 21, 2014
NobleIDNI0P68W57R82S22
Authors:
Si Si
,
Cho‐Jui Hsieh
,
Inderjit S. Dhillon

Abstract

The scalability of kernel machines is a big challenge when facing millions of samples due to storage and computation issues for large kernel matrices, that are usually dense. Recently, many papers have suggested tackling this problem by using a low-rank approximation of the kernel matrix. In this pa...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!