For cubic SKI the inducing-point count should grow as n^{d/3}; the advertised linear-time regime d≤3 is incorrect because at d=3 the paper's own inequality forces error to grow with n.
Smooth optimization with approximate gradient
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
The Price of Linear Time: Error Analysis of Structured Kernel Interpolation
For cubic SKI the inducing-point count should grow as n^{d/3}; the advertised linear-time regime d≤3 is incorrect because at d=3 the paper's own inequality forces error to grow with n.