paper-with-me

홈 › Papers

Importance Weighting Correction of Regularized Least-Squares for Covariate and Target Shifts

2022-10-18 · Davit Gogolashvili

In many real world problems, the training data and test data have different distributions. This situation is commonly referred as a dataset shift. The most common settings for dataset shift often considered in the literature are {\em covariate shift } and {\em target shift}. Importance weighting (IW) correction is a universal method for correcting the bias present in learning scenarios under dataset shift. The question one may ask is: does IW correction work equally well for different dataset shift scenarios? By investigating the generalization properties of the weighted kernel ridge regression (W-KRR) under covariate and target shifts we show that the answer is negative, except when IW is bounded and the model is wellspecified. In the latter cases, a minimax optimal rates are achieved by importance weighted kernel ridge regression (IW-KRR) in both, covariate and target shift scenarios. Slightly relaxing the boundedness condition of the IW we show that the IW-KRR still achieves the optimal rates under target shift while leading to slower rates for covariate shift. In the case of the model misspecification we show that the performance of the W-KRR under covariate shift could be substantially increased by designing an alternative reweighting function. The distinction between misspecified and wellspecified scenarios does not seem to be crucial in the learning problems under target shift.

📄 PDF Abstract BibTeX arXiv:2210.09709

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

A Weighted Least-Squares Method for Non-Asymptotic Identification of Markov Parameters from Multiple Trajectories

2024-05-07 · Jiabao He, Cristian R. Rojas, Håkan Hjalmarsson

Markov parameters play a key role in system identification. There exists many algorithms where these parameters are estimated using least-squares in a first, pre-processing, step, including subspace identification and mu…

Equivalence of Learning Algorithms

2014-06-10 · Julien Audiffren, Hachem Kadri

The purpose of this paper is to introduce a concept of equivalence between machine learning algorithms. We define two notions of algorithmic equivalence, namely, weak and strong equivalence. These notions are of paramoun…

BIG-bench Machine Learningregression

An LiGME Regularizer of Designated Isolated Minimizers -- An Application to Discrete-Valued Signal Estimation

2025-03-13 · Satoshi Shoji, Wataru Yata, Keita Kume, Isao Yamada

For a regularized least squares estimation of discrete-valued signals, we propose a Linearly involved Generalized Moreau Enhanced (LiGME) regularizer, as a nonconvex regularizer, of designated isolated minimizers. The pr…

Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squares

2021-02-08 · NeurIPS 2021 12 · Hiroaki Yamada, Makoto Yamada

A recently introduced technique for a sparse optimization problem called "safe screening" allows us to identify irrelevant variables in the early stage of optimization. In this paper, we first propose a flexible framewor…

A Risk Comparison of Ordinary Least Squares vs Ridge Regression

2011-05-04 · Paramveer S. Dhillon, Dean P. Foster, Sham M. Kakade, Lyle H. Ungar

We compare the risk of ridge regression to a simple variant of ordinary least squares, in which one simply projects the data onto a finite dimensional subspace (as specified by a Principal Component Analysis) and then pe…

regression