Oblivious Sketching of High-Degree Polynomial Kernels

DOI10.1137/1.9781611975994.9OpenAlexW3001361757MaRDI QIDQ5146770

Amir Zandieh, Rasmus Pagh, Jakob Bæk Tejs Knudsen, David P. Woodruff, Thomas D. Ahle, Ameya Velingker, Michael Kapralov

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.01410

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (7)

Johnson–Lindenstrauss Embeddings with Kronecker Structure ⋮ Kernel Approximation on Algebraic Varieties ⋮ The Hanson-Wright inequality for random tensors ⋮ Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery ⋮ Unnamed Item ⋮ Tensor Methods for Nonlinear Matrix Completion ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares

This page was built for publication: Oblivious Sketching of High-Degree Polynomial Kernels