Transfer Learning in $\ell_1$ Regularized Regression: Hyperparameter Selection Strategy based on Sharp Asymptotic Analysis
Koki Okajima, Tomoyuki Obuchi
TL;DR
This work analyzes transfer learning for high-dimensional sparse regression within a generalized two-stage Trans-Lasso framework. Using the replica method, it derives sharp asymptotic generalization errors ε^(1st) and ε^(2nd) in terms of finite-order parameters Θ1, Θ2 that satisfy nonlinear equations of state, enabling principled hyperparameter selection. A key finding is that transferring either the support information or the pretrained vector alone suffices to achieve near-optimal performance, suggesting simple, robust hyperparameter strategies (Δλ = 0 or κ = 0) that often match more exhaustive LO tuning. These insights are corroborated by synthetic simulations and real-data experiments on IMDb and MNIST, showing practical reductions in hyperparameter search while maintaining or improving predictive accuracy. The results have direct implications for deploying transfer-learning in high-dimensional sparse regression, especially when target data are scarce or noisy.
Abstract
Transfer learning techniques aim to leverage information from multiple related datasets to enhance prediction quality against a target dataset. Such methods have been adopted in the context of high-dimensional sparse regression, and some Lasso-based algorithms have been invented: Trans-Lasso and Pretraining Lasso are such examples. These algorithms require the statistician to select hyperparameters that control the extent and type of information transfer from related datasets. However, selection strategies for these hyperparameters, as well as the impact of these choices on the algorithm's performance, have been largely unexplored. To address this, we conduct a thorough, precise study of the algorithm in a high-dimensional setting via an asymptotic analysis using the replica method. Our approach reveals a surprisingly simple behavior of the algorithm: Ignoring one of the two types of information transferred to the fine-tuning stage has little effect on generalization performance, implying that efforts for hyperparameter selection can be significantly reduced. Our theoretical findings are also empirically supported by applications on real-world and semi-artificial datasets using the IMDb and MNIST datasets, respectively.
