Learning Bound for Parameter Transfer Learning
Not on the map. Why?
Abstract (arXiv)
We consider a transfer-learning problem by using the parameter transfer approach, where a suitable parameter of feature mapping is learned through one task and applied to another objective task. Then, we introduce the notion of the local stability and parameter transfer learnability of parametric feature mapping,and thereby derive a learning bound for parameter transfer algorithms. As an application of parameter transfer learning, we discuss the performance of sparse coding in self-taught learning. Although self-taught learning algorithms with plentiful unlabeled data often show excellent empirical performance, their theoretical analysis has not been studied. In this paper, we also provide the first theoretical learning bound for self-taught learning.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 27 Oct 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Frustratingly Easy Transferability Estimationcited by 45
- 2021Frustratingly Easy Transferability Estimation17 Jun 2021