More Like this

1. Targeted Transfer Learning: Leveraging Optimal Transport for Enhanced Knowledge Transfer

   https://doi.org/10.1109/ICNC59896.2024.10556294  

   Ahamed, Sayyed Farid; Islam, Kazi Aminul; Shetty, Sachin (February 2024, IEEE)
2. Graph transfer learning

   https://doi.org/10.1007/s10115-022-01782-6  

   Gritsenko, Andrey; Shayestehfard, Kimia; Guo, Yuan; Moharrer, Armin; Dy, Jennifer; Ioannidis, Stratis (December 2022, Knowledge and Information Systems)
3. Graph Transfer Learning

   https://doi.org/10.1109/ICDM51629.2021.00024  

   Gritsenko, Andrey; Guo, Yuan; Shayestehfard, Kimia; Moharrer, Armin; Dy, Jennifer; Ioannidis, Stratis (January 2021, IEEE International Conference on Data Mining)

   Graph embeddings have been tremendously successful at producing node representations that are discriminative for downstream tasks. In this paper, we study the problem of graph transfer learning: given two graphs and labels in the nodes of the first graph, we wish to predict the labels on the second graph. We propose a tractable, noncombinatorial method for solving the graph transfer learning problem by combining classification and embedding losses with a continuous, convex penalty motivated by tractable graph distances. We demonstrate that our method successfully predicts labels across graphs with almost perfect accuracy; in the same scenarios, training embeddings through standard methods leads to predictions that are no better than random. 

   more » « less
4. 13C Saturation-Transfer Difference (STD)-NMR Experiments Using INEPT Polarization Transfer

   https://doi.org/10.1007/s00723-019-01182-0  

   Xu, Hui; Lustig, Danielle; Casabianca, Leah B. (March 2020, Applied Magnetic Resonance)
5. Robust Tickets Can Transfer Better: Drawing More Transferable Subnetworks in Transfer Learning

   https://doi.org/10.1109/DAC56929.2023.10247920  

   Fu, Yonggan; Yuan, Ye; Wu, Shang; Yuan, Jiayi; Lin, Yingyan Celine (July 2023, 2023 60th ACM/IEEE Design Automation Conference (DAC))

   Transfer learning leverages feature representations of deep neural networks (DNNs) pretrained on source tasks with rich data to empower effective finetuning on downstream tasks. However, the pre-trained models are often prohibitively large for delivering generalizable representations, which limits their deployment on edge devices with constrained resources. To close this gap, we propose a new transfer learning pipeline, which leverages our finding that robust tickets can transfer better, i.e., subnetworks drawn with properly induced adversarial robustness can win better transferability over vanilla lottery ticket subnetworks. Extensive experiments and ablation studies validate that our proposed transfer learning pipeline can achieve enhanced accuracy-sparsity trade-offs across both diverse downstream tasks and sparsity patterns, further enriching the lottery ticket hypothesis. 

   more » « less