REVIEW 1 cited by
But How Does It Work in Theory? Linear SVM with Random Features
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
abstract
We prove that, under low noise assumptions, the support vector machine with $N\ll m$ random features (RFSVM) can achieve the learning rate faster than $O(1/\sqrt{m})$ on a training set with $m$ samples when an optimized feature map is used. Our work extends the previous fast rate analysis of random features method from least square loss to 0-1 loss. We also show that the reweighted feature selection method, which approximates the optimized feature map, helps improve the performance of RFSVM in experiments on a synthetic data set.
Forward citations
Cited by 1 Pith paper
-
Additive function approximation in the brain
Sparse random feature networks with in-degree d are equivalent to order-d additive models, and a distribution of in-degrees yields a mixture of additive kernels.
Discussion (0). Continue with ORCID to comment.