Pseudo-Labeling for Covariate Shift Adaptation

Published on ● Video Link: https://www.youtube.com/watch?v=iB3RNarr4bA



Duration: 0:00
334 views
0


Kaizheng Wang (Columbia University)
https://simons.berkeley.edu/talks/kaizheng-wang-columbia-university-2024-11-12
Domain Adaptation and Related Areas

We develop and analyze a covariate shift adaptation method based on pseudo-labeling. 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 run regression on them separately to obtain (1) a collection of candidate models induced by different hyperparameters, and (2) an imputation model. We use the latter to fill the missing labels and then select the best candidate model accordingly. To investigate the influence of pseudo-labels on model selection, we derive a bias-variance decomposition that highlights the importance of using an imputation model with low bias. We demonstrate the efficacy of our approach through kernel ridge regression, proving that our method effectively adapts to the unknown covariate shift.




Other Videos By Simons Institute for the Theory of Computing


2024-11-14Open-Source and Science in the Era of Foundation Models
2024-11-13Toward Understanding the Extrapolation of Nonlinear Models to Unseen Domains or the Whole Domain
2024-11-13Language-guided Adaptation
2024-11-13On Spurious Associations and LLM Alignment
2024-11-13Causally motivated robustness to shortcut learning
2024-11-13Talk by Zachary Lipton
2024-11-12Distribution shift in ecological data: generalization vs. specialization,
2024-11-12Transfer learning via local convergence rates of the nonparametric least squares estimator
2024-11-12Transfer learning for weak-to-strong generalization
2024-11-12User-level and federated local differential privacy
2024-11-11Pseudo-Labeling for Covariate Shift Adaptation
2024-10-16The Enigma of LLMs: on Creativity, Compositionality, Pluralism, and Paradoxes
2024-10-02Let’s Try and Be More Tolerant: On Tolerant Property Testing and Distance Approximation
2024-10-02A Strong Separation for Adversarially Robust L_0 Estimation for Linear Sketches
2024-10-02Towards Practical Distribution Testing
2024-10-02Toward Optimal Semi-streaming Algorithm for (1+ε)-approximate Maximum Matching
2024-10-02Plenary Talk: Privately Evaluating Untrusted Black-Box Functions
2024-10-02The long path to \sqrt{d} monotonicity testers
2024-10-02O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set
2024-10-02Distribution Learning Meets Graph Structure Sampling
2024-10-02On the instance optimality of detecting collisions and subgraphs