A sufficiency-penalized model averaging transfer learning method that adaptively selects informative domains, with convergence rates, optimality, and asymptotic normality.
On Hypothesis Transfer Learning of Functional Linear Models
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study the transfer learning (TL) for the functional linear regression (FLR) under the Reproducing Kernel Hilbert Space (RKHS) framework, observing that the TL techniques in existing high-dimensional linear regression are not compatible with the truncation-based FLR methods, as functional data are intrinsically infinite-dimensional and generated by smooth underlying processes. We measure the similarity across tasks using RKHS distance, allowing the type of information being transferred to be tied to the properties of the imposed RKHS. Building on the hypothesis offset transfer learning paradigm, two algorithms are proposed: one conducts the transfer when positive sources are known, while the other leverages aggregation techniques to achieve robust transfer without prior information about the sources. We establish asymptotic lower bounds for this learning problem and show that the proposed algorithms enjoy a matching upper bound. These analyses provide statistical insights into factors that contribute to the dynamics of the transfer. We also extend the results to functional generalized linear models. The effectiveness of the proposed algorithms is demonstrated via extensive synthetic data as well as real-world data applications.
fields
stat.ME 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sufficiency-principled Transfer Learning via Model Averaging
A sufficiency-penalized model averaging transfer learning method that adaptively selects informative domains, with convergence rates, optimality, and asymptotic normality.