REVIEW 2 cited by
Pseudo-Labeling for Kernel Ridge Regression under Covariate Shift
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
read the original abstract
We develop and analyze a principled approach to kernel ridge regression under covariate shift. The goal is to learn a regression function with small mean squared error over a target distribution, based on unlabeled data from there and labeled data that may have a different feature distribution. We propose to split the labeled data into two subsets, and conduct kernel ridge regression on them separately to obtain a collection of candidate models and an imputation model. We use the latter to fill the missing labels and then select the best candidate accordingly. Our non-asymptotic excess risk bounds demonstrate that our estimator adapts effectively to both the structure of the target distribution and the covariate shift. This adaptation is quantified through a notion of effective sample size that reflects the value of labeled source data for the target regression task. Our estimator achieves the minimax optimal error rate up to a polylogarithmic factor, and we find that using pseudo-labels for model selection does not significantly hinder performance.
Forward citations
Cited by 2 Pith papers
-
On Non-Stationary Dynamic Pricing: Adaptivity and Optimality
An adaptive dynamic-pricing algorithm achieves, up to logarithmic factors, the minimax optimal regret for both abrupt and smooth non-stationarity in contextual GLM demand, and comes with a matching lower bound.
-
Fixed-Gaussian Spectral Algorithms: Minimax Optimal Rates for Misspecified Learning and Transfer
Fixed-bandwidth Gaussian kernels let any spectral algorithm achieve minimax nonparametric rates, and the resulting two-stage procedure attains near-optimal transfer learning under concept shift.
Discussion (0). Continue with ORCID to comment.