arXiv AI
Help Me Help You: The Aggregate Value of Source and Target Data in Transfer Learning
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 1
A Unified and Stable Risk Minimization Framework for Weakly Supervised Learning with Theoretical Guarantees
arXiv:2511. 22823v2 Announce Type: replace-cross Abstract: Weakly supervised learning has emerged as a practical alternative to fully supervised learning when complete and accurate labels are costly or infeasible to acquire.
arXiv Machine Learning
Jun 17
Learning from Biased and Costly Data Sources: Minimax-optimal Data Collection under a Budget
arXiv:2602. 17894v2 Announce Type: replace-cross Abstract: Data collection is a critical component of modern statistical and machine learning pipelines, particularly when data must be gathered from multiple heterogeneous sources to study a target population of interest.
arXiv Machine Learning
Sep 14
Transfer Learning for Evolving Domains
The paper introduces Transfer Learning for Evolving Domains (TrED), a framework that models how data availability changes over time in real-world applications. TrED treats the entire trajectory of model updates as a single learning problem, rather than isolated snapshots, and defines a data availability process, a flexible learning protocol, and an evaluation criterion that scores the whole trajectory. The authors review existing transfer learning methods, noting that most are tailored to specific regimes and do not optimize the full trajectory, and argue that TrED is a well‑posed, unsolved research direction.
arXiv Machine Learning
Aug 13
Heterogeneous transfer learning for high-dimensional regression with feature mismatch
arXiv:2412. 18081v3 Announce Type: replace-cross Abstract: We study Heterogeneous Transfer Learning (HTL) for high-dimensional regression with differing feature sets.
arXiv AI
Sep 17
Limits of Transfer Learning
The paper investigates the theoretical limits of transfer learning, demonstrating that careful selection of transferable information and its dependence on target problems is crucial. It establishes that the degree of probabilistic change in a transfer-learning algorithm imposes an upper bound on achievable improvement. These findings extend the algorithmic search framework to a broad class of learning tasks involving transfer.
arXiv Machine Learning
Jul 1
When few labeled target data suffice: a theory of semi-supervised domain adaptation via fine-tuning from multiple adaptive starts
arXiv:2507. 14661v2 Announce Type: replace-cross Abstract: Semi-supervised domain adaptation (SSDA) seeks to achieve accurate predictions in a target domain with limited labeled target data by exploiting abundant source and unlabeled target data.