Tensor Sketch approximates the polynomial kernel with low-dimensional random features in O(n(d + D log D)) time, but the revised variance bound in this version is not established by the proof.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
Tensor Sketch approximates the polynomial kernel with low-dimensional random features in O(n(d + D log D)) time, but the revised variance bound in this version is not established by the proof.