REVIEW 3 cited by
Explicit Approximations of the Gaussian Kernel
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We investigate training and using Gaussian kernel SVMs by approximating the kernel with an explicit finite- dimensional polynomial feature representation based on the Taylor expansion of the exponential. Although not as efficient as the recently-proposed random Fourier features [Rahimi and Recht, 2007] in terms of the number of features, we show how this polynomial representation can provide a better approximation in terms of the computational cost involved. This makes our "Taylor features" especially attractive for use on very large data sets, in conjunction with online or stochastic training.
Forward citations
Cited by 3 Pith papers
-
Oblivious Sketching of High-Degree Polynomial Kernels
A recursive sketching tree applies existing linear sketches to tensor products without forming them, giving the first oblivious subspace embeddings for high-degree polynomial and Gaussian kernels whose dimension is po...
-
Improving TensorSketch Using Complex Random Variables
A complex-to-real TensorSketch is claimed to reduce polynomial-kernel sketch variance growth to 2^p/D, but the proof's expansion of the squared modulus of the complex inner product omits conjugation.
-
SchoenbAt: Rethinking Attention with Polynomial basis
SchoenbAt approximates dot-product kernelized attention with random Maclaurin features under Schoenberg's theorem, adding a batch-normalization step that keeps inputs within the theorem's domain.
Discussion (0). Continue with ORCID to comment.