Papers › Tight Dimensionality Reduction for Sketching Low Degree Polynomial Kernels

Tight Dimensionality Reduction for Sketching Low Degree Polynomial Kernels

1 Dec 2019NeurIPS 2019 12archive 2025-07-28

Michela Meister, Tamas Sarlos, David Woodruff

We revisit the classic randomized sketch of a tensor product of q vectors xᵢ∈ℝⁿ. The i-th coordinate (Sx)ᵢ of the sketch is equal to ∏_(j = 1)^q ⟨u^(i, j), xʲ ⟩/ √(m), where u^(i,j) are independent random sign vectors. Kar and Karnick (JMLR, 2012) show that if the sketching dimension m = Ω(ϵ⁻² C_Ω² log(1/δ)), where C_Ω is a certain property of the point set Ω one wants to sketch, then with probability 1-δ, ‖Sx‖₂ = (1±ϵ)‖x‖₂ for all x∈Ω. However, in their analysis C_Ω² can be as large as Θ(n^(2q)), even for a set Ω of O(1) vectors x. We give a new analysis of this sketch, providing nearly optimal bounds. Namely, we show an upper bound of m = Θ(ϵ⁻² log(n/δ) + ϵ⁻¹ log^q(n/δ) ), which by composing with CountSketch, can be improved to Θ(ϵ⁻²log(1/(δϵ)) + ϵ⁻¹ log^q (1/(δϵ)). For the important case of q = 2 and δ= 1/poly(n), this shows that m = Θ(ϵ⁻² log(n) + ϵ⁻¹ log²(n)), demonstrating that the ϵ⁻² and log²(n) terms do not multiply each other. We also show a nearly matching lower bound of m = Ω(ε⁻² log(1/(δ)) + ε⁻¹ log^q(1/(δ))). In a number of applications, one has |Ω| = poly(n) and in this case our bounds are optimal up to a constant factor. This is the first high probability sketch for tensor products that has optimal sketch size and can be implemented in m ·∑ᵢ₌₁^q nnz(xᵢ) time, where nnz(xᵢ) is the number of non-zero entries of xᵢ. Lastly, we empirically compare our sketch to other sketches for tensor products, and give a novel application to compressing neural networks.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

google-research/google-research officialmentioned in papertfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Efficient Neural Architecture Search via Parameter Sharing (arXiv:1802.03268; that paper's own run record: 18 ran (of which 10 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 6 where Syntology's instrument failed) · 20 unverified), Milking CowMask for Semi-Supervised Image Classification (arXiv:2003.12022; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result), Neural Additive Models: Interpretable Machine Learning with Neural Nets (arXiv:2004.13912; that paper's own run record: 26 ran (of which 14 constructed an object rather than computing a result; 26 with no instrument failure: 5 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified) and 21 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Dimensionality Reduction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections