Transfer Learning under High-dimensional Generalized Linear Models
In this work, we study the transfer learning problem under high-dimensional generalized linear models (GLMs), which aim to improve the fit on target data by borrowing information from useful source data. Given which sources to transfer, we propose a transfer learning algorithm on GLM, and derive its $\ell_1/\ell_2$-estimation error bounds as well as a bound for a prediction error measure. The theoretical analysis shows that when the target and source are sufficiently close to each other, these bounds could be improved over those of the classical penalized estimator using only target data under mild conditions. When we don't know which sources to transfer, an algorithm-free transferable source detection approach is introduced to detect informative sources. The detection consistency is proved under the high-dimensional GLM transfer learning setting. We also propose an algorithm to construct confidence intervals of each coefficient component, and the corresponding theories are provided. Extensive simulations and a real-data experiment verify the effectiveness of our algorithms. We implement the proposed GLM transfer learning algorithms in a new R package glmtrans, which is available on CRAN.
Code (0)
등록된 구현이 없습니다.
Tasks
Transfer LearningVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
Heterogeneous Transfer Learning for Building High-Dimensional Generalized Linear Models with Disparate Datasets
Development of comprehensive prediction models are often of great interest in many disciplines of science, but datasets with information on all desired features often have small sample sizes. We describe a transfer learn…
Transfer LearningOn Hypothesis Transfer Learning of Functional Linear Models
We study the transfer learning (TL) for the functional linear regression (FLR) under the Reproducing Kernel Hilbert Space (RKHS) framework, observing the TL techniques in existing high-dimensional linear regression is no…
regressionTransfer LearningA Class of Geometric Structures in Transfer Learning: Minimax Bounds and Optimality
We study the problem of transfer learning, observing that previous efforts to understand its information-theoretic limits do not fully exploit the geometric structure of the source and target domains. In contrast, our st…
Transfer LearningLow Dimensional Koopman Generalized Eigenfunctions Representation: An Approach to Address Koopman High-Dimensionality Problem
This Paper introduces a methodology to achieve a lower dimensional Koopman quasi linear representation of nonlinear dynamics using Koopman generalized eigenfunctions. The methodology is presented for the analytically der…
Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data
We propose a minimax concave penalized multi-armed bandit algorithm under generalized linear model (G-MCP-Bandit) for a decision-maker facing high-dimensional data in an online learning and decision-making process. We de…
Decision Making