Pith. sign in

REVIEW

A Theoretical Analysis of the Test Error of Finite-Rank Kernel Ridge Regression

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

arxiv 2310.00987 v2 pith:TKNZ324Z submitted 2023-10-02 cs.LG stat.ML

classification cs.LGstat.ML
keywords finite-rankboundskernellearningwhenerrorkernelsregression
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Existing statistical learning guarantees for general kernel regressors often yield loose bounds when used with finite-rank kernels. Yet, finite-rank kernels naturally appear in several machine learning problems, e.g.\ when fine-tuning a pre-trained deep neural network's last layer to adapt it to a novel task when performing transfer learning. We address this gap for finite-rank kernel ridge regression (KRR) by deriving sharp non-asymptotic upper and lower bounds for the KRR test error of any finite-rank KRR. Our bounds are tighter than previously derived bounds on finite-rank KRR, and unlike comparable results, they also remain valid for any regularization parameters.

Discussion (0). Sign in to comment.

Pith tools