EDBT 2026 Demo / reviewers in the wild / expert
Javan Tahir
dblp:391/6606
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Learning theory · 33% Transfer learning and domain adaptation · 33% Deep learning architectures and training · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training › feedforward neural network
deep linear networks |
0.9 | 1 | 2025 | Features are fate: a theory of transfer learning in high-dimensional regression · ICML 2025 |
Machine learning › Transfer learning and domain adaptation
fine-tuning |
0.9 | 1 | 2025 | Features are fate: a theory of transfer learning in high-dimensional regression · ICML 2025 |
Machine learning › Learning theory
transfer learning theory |
0.9 | 1 | 2025 | Features are fate: a theory of transfer learning in high-dimensional regression · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
phase diagram analysis · 0.9high-dimensional regression · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Features are fate: a theory of transfer learning in high-dimensional regressionabstractWith the emergence of large-scale pre-trained neural networks, methods to adapt such "foundation" models to data-limited downstream tasks have become a necessity.
Fine-tuning, preference optimization, and transfer learning have all been successfully employed for these purposes when the target task closely resembles the source task, but a precise theoretical understanding of ``task similarity'' is still lacking.
We adopt a \emph{feature-centric} viewpoint on transfer learning and establish a number of theoretical results that demonstrate that when the target task is well represented by the feature space of the pre-trained model, transfer learning outperforms training from scratch.
We study deep linear networks as a minimal model of transfer learning in which we can analytically characterize the transferability phase diagram as a function of the target dataset size and the feature space overlap.
For this model, we establish rigorously that when the feature space overlap between the source and target tasks is sufficiently strong, both linear transfer and fine-tuning improve performance, especially in the low data limit.
These results build on an emerging understanding of feature learning dynamics in deep linear networks, and we demonstrate numerically that the rigorous results we derive for the linear case also apply to nonlinear networks. Javan Tahir, Surya Ganguli, Grant M. Rotskoff |
ICML | 1 |