Help Me Help You: The Aggregate Value of Source and Target Data in Transfer Learning
Not on the map. Why?
Abstract (arXiv)
Transfer learning, in regression or classification, concerns problems where one aims to use imperfect data from a source distribution P to improve prediction w.r.t. a target distribution Q. While there is now much theoretical understanding of the unsupervised setting of this problem (where no labeled target data is available), the supervised setting with labeled target data remains under-studied. We identify and characterize an interesting dichotomy in the rates achievable in the supervised setting: there is a weak transfer regime where optimal rates are determined by information in either the source or target dataset but not both, and a strong transfer regime where much faster target rates are achievable, accounting for complementary information in source and target data. Furthermore, while previous theoretical tools for the unsupervised setting can be extended to capture the weak transfer regime, we argue that they cannot capture the strong regime due to limitations inherent in the various notions of relatedness they rely on. Instead, we provide an appropriate refinement of relatedness notions---termed weak and strong moduli of transfer---that reveal the two regimes and lead to a nontrivial characterization of which pairs of distributions P and Q adhere to which regime. Finally, the above dichotomy reveals a new categorization of existing algorithmic approaches in terms of their optimality or lack-thereof across supervised regimes, and we provide a generic approach that remains nearly optimal in all regimes without prior distributional knowledge.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 65 references that are in the map. First posted on arXiv 29 Aug 2024.
Builds on
25 of 65 references.
References · 25
- 2019Invariant Risk Minimizationcited by 1,832
- 2015An Introduction to Matrix Concentration Inequalitiescited by 391
- 2020Few-Shot Learning via Learning the Representation, Provablycited by 213
- 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
- 2020A Survey on Negative Transfercited by 120
- 2016Theoretical Analysis of Domain Adaptation with Optimal Transportcited by 105
- 2019Provable Guarantees for Gradient-Based Meta-Learningcited by 67
- 2018Marginal Singularity, and the Benefits of Labels in Covariate-Shiftcited by 65
- 2019Transfer Learning for Nonparametric Classification: Minimax Rate and Adaptive Classifiercited by 64
- 2020On the Value of Target Data in Transfer Learningcited by 62
- 2021Quantifying and Improving Transferability in Domain Generalizationcited by 35
- 2022A new similarity measure for covariate shift with applications to nonparametric regressioncited by 33
13 more
- 2020Minimax Lower Bounds for Transfer Learning with Linear and One-hidden Layer Neural Networkscited by 30
- 2020A No-Free-Lunch Theorem for MultiTask Learningcited by 28
- 2023Testable Learning with Distribution Shiftcited by 25
- 2018A Generalized Neyman-Pearson Criterion for Optimal Domain Adaptationcited by 22
- 2023Maximum Likelihood Estimation is All You Need for Well-Specified Covariate Shiftcited by 14
- 2023Metalearning with Very Few Samples Per Taskcited by 11
- 2022A Class of Geometric Structures in Transfer Learning: Minimax Bounds and Optimalitycited by 9
- 2023Limits of Model Selection under Transfer Learningcited by 9
- 2023Nonlinear Meta-Learning Can Guarantee Faster Ratescited by 8
- 2023Prominent Roles of Conditionally Invariant Components in Domain Adaptation: Theory and Algorithmscited by 5
- 2024High-Dimensional Kernel Methods under Covariate Shift: Data-Dependent Implicit Regularizationcited by 4
- 2023Classification Tree Pruning Under Covariate Shiftcited by 3
- 2024Estimation of multiple mean vectors in high dimensioncited by 3
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.