Characterization of Transfer Using Multi-task Learning Curves

András Millinghoffer, Bence Bolgár, Péter Antal
12/31/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Transfer effects manifest themselves both during training using a fixed data set and in inductive inference using accumulating data. We hypothesize that perturbing the data set by including more samples, instead of perturbing the model by gradient updates, provides a complementary and more fundamental characterization of transfer effects. To capture this phenomenon, we quantitatively model transfer effects using multi-task learning curves approximating the inductive performance over varying sample sizes. We describe an efficient method to approximate multi-task learning curves analogous to the Task Affinity Grouping method applied during training. We compare the statistical and computational approaches to transfer, which indicates considerably higher compute costs for the previous but better power and broader applicability. Evaluations are performed using a benchmark drug-target interaction data set. Our results show that learning curves can better capture the effects of multi-task learning and their multi-task extensions can delineate pairwise and contextual transfer effects in foundation models.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{millinghoffer2025characterization,
  title  = {Characterization of Transfer Using Multi-task Learning Curves},
  author = {András Millinghoffer and Bence Bolgár and Péter Antal},
  year   = {2025},
  eprint = {2512.24866},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.24866v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.24866.svg)](https://codeofpaper.com/paper/2512.24866)

Discussion