aiqbench analysis
The thesis tests whether strong source-task generalization guarantees transfer to a related target task, using adversarial attacks on the transfer procedure. Its empirical finding is a strong link between source generalization and transferability, though it doesn't establish that generalization is sufficient. Readers working on transfer pipelines should note that source-task validation metrics appear to be a reasonable proxy, but not a proof, for downstream transfer.
Exploring Bad Minima in Transfer Learning
arXiv:2610.41807v1 Announce Type: new Abstract: Transfer learning is a highly successful learning paradigm in deep learning which leverages knowledge from one task and applies it to another. Despite its success, the necessary conditions for knowledge transfer are unclear and require further research. In this dissertation, our aim is to understand transferability a little better by answering the following question: Does good generalization on a source task necessarily imply transferability to a related target task? We hypothesize the answer is negative, and attempt to find counterexamples via adversarial attacks on the transfer learning procedure. Over three types of adversarial attacks, our empirical results show a strong relationship between generalization on the source task and transferability. These results do not rule out generalization on the source task as a sufficient condition for successful transfer.
Abstract:Transfer learning is a highly successful learning paradigm in deep learning which leverages knowledge from one task and applies it to another. Despite its success, the necessary conditions for knowledge transfer are unclear and require further research. In this dissertation, our aim is to understand transferability a little better by answering the following question: Does good generalization on a source task necessarily imply transferability to a related target task? We hypothesize the answer is negative, and attempt to find counterexamples via adversarial attacks on the transfer learning procedure. Over three types of adversarial attacks, our empirical results show a strong relationship between generalization on the source task and transferability. These results do not rule out generalization on the source task as a sufficient condition for successful transfer.
57 pages, 13 figures, 3 tables. MPhil thesis, University of Cambridge, 2022. Supervised by Ferenc Huszár
Machine Learning (cs.LG); Cryptography and Security (cs.CR)
arXiv:2610.41807 [cs.LG]
(or arXiv:2610.41807v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.41807 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 241 words
Related coverage
SPR: Toward a Graph Foundation Model for Transferable Graph Cognition via Spectral Patterns and Relational Geometry
arXiv · Sep 30, 2026
Merge Now, Regret Later: The Hidden Cost of Model Merging Is Adversarial Transferability
arXiv · Aug 21, 2026
Enhancing Many-Body Chaos via Entropy Injection from Environment
arXiv · Jun 11, 2026
Investigating Knowledge Transfer Across Interactive Dialogue Games
arXiv · Aug 26, 2026