Oblivious sketching of high-degree polynomial kernels
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- Oblivious Sketching of High-Degree Polynomial Kernels∗
Forlagets udgivne version, 1,25 MB, PDF-dokument
Kernel methods are fundamental tools in machine learning that allow detection of non-linear dependencies between data without explicitly constructing feature vectors in high dimensional spaces. A major disadvantage of kernel methods is their poor scalability: primitives such as kernel PCA or kernel ridge regression generally take prohibitively large quadratic space and (at least) quadratic time, as kernel matrices are usually dense. Some methods for speeding up kernel linear algebra are known, but they all invariably take time exponential in either the dimension of the input point set (e.g., fast multipole methods suffer from the curse of dimensionality) or in the degree of the kernel function. Oblivious sketching has emerged as a powerful approach to speeding up numerical linear algebra over the past decade, but our understanding of oblivious sketching solutions for kernel matrices has remained quite limited, suffering from the aforementioned exponential dependence on input parameters. Our main contribution is a general method for applying sketching solutions developed in numerical linear algebra over the past decade to a tensoring of data points without forming the tensoring explicitly. This leads to the first oblivious sketch for the polynomial kernel with a target dimension that is only polynomially dependent on the degree of the kernel function, as well as the first oblivious sketch for the Gaussian kernel on bounded datasets that does not suffer from an exponential dependence on the dimensionality of input data points.
Originalsprog | Engelsk |
---|---|
Titel | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 |
Redaktører | Shuchi Chawla |
Antal sider | 20 |
Forlag | Association for Computing Machinery |
Publikationsdato | 2020 |
Sider | 141-160 |
ISBN (Elektronisk) | 9781611975994 |
Status | Udgivet - 2020 |
Begivenhed | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 - Salt Lake City, USA Varighed: 5 jan. 2020 → 8 jan. 2020 |
Konference
Konference | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 |
---|---|
Land | USA |
By | Salt Lake City |
Periode | 05/01/2020 → 08/01/2020 |
Sponsor | ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), SIAM Activity Group on Discrete Mathematics |
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
ID: 258720675