Transferability-Guided Cross-Domain Cross-Task Transfer Learning
Open accessAbstract
We propose two novel transferability metrics fast optimal transport-based conditional entropy (F-OTCE) and joint correspondence OTCE (JC-OTCE) to evaluate how much the source model (task) can benefit the learning of the target task and to learn more generalizable representations for cross-domain cross-task transfer learning. Unlike the original OTCE metric that requires evaluating the empirical transferability on auxiliary tasks, our metrics are auxiliary-free such that they can be computed much more efficiently. Specifically, F-OTCE estimates transferability by first solving an optimal transport (OT) problem between source and target distributions and then uses the optimal coupling to compute the negative conditional entropy (NCE) between the source and target labels. It can also serve as an objective function to enhance downstream transfer learning tasks including model finetuning and domain generalization (DG). Meanwhile, JC-OTCE improves the transferability accuracy of F-OTCE by including label distances in the OT problem, though it incurs additional computation costs. Extensive experiments demonstrate that F-OTCE and JC-OTCE outperform state-of-the-art auxiliary-free metrics by 21.1% and 25.8%, respectively, in correlation coefficient with the ground-truth transfer accuracy. By eliminating the training cost of auxiliary tasks, the two metrics reduce the total computation time of the previous method from 43 min to 9.32 and 10.78 s, respectively, for a pair of tasks. When applied in the model finetuning and DG tasks, F-OTCE shows significant improvements in the transfer accuracy in few-shot classification experiments, with up to 4.41% and 2.34% accuracy gains, respectively.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Prior research on domain adaptation and domain generalization highlights the cross-scenario generalization issue but often lacks comprehensive, practical strategies tailored specifically for deepfake detection.
“Prior research on domain adaptation [258] and domain generalization [259] highlights this issue but often lacks comprehensive, practical strategies tailored specifically for deepfake detection.”
From Evolving from Single-modal to Multi-modal Facial Deepfake Detection: Progress and Challenges (2024) · cites this paper as [259]
The Introduction (page unavailable) discusses generalization across source and target domains, supporting the cross-scenario aspect of the claim. The paper presents general transfer-learning methods, but our copy does not assess whether prior research often lacks comprehensive, practical strategies for deepfake detection. (LLM, conf=0.78)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474 · cited 3× · see citing works
“In addition, we further examine the effectiveness of our OTCE-based finetune algorithm with different model architectures including famous LeNet [59] for character recognition (MNIST → Omniglot) and the ResNet-18 [36] for natural image classification (Caltech101 → MiniImageNet).”
Self-citationGradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805 · cited 1× · see citing works
“In addition, we further examine the effectiveness of our OTCE-based finetune algorithm with different model architectures including famous LeNet [59] for character recognition (MNIST → Omniglot) and the ResNet-18 [36] for natural image classification (Caltech101 → MiniImageNet).”
Microsoft COCO: Common Objects in Context
Lin, T.-Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollár, P., & Zitnick, C. L. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10602-1_48 · Cited by 45,460 · see citing works
ImageNet Large Scale Visual Recognition Challenge
Russakovsky, O., Deng, J., Su, H., Krause, J., Satheesh, S., Ma, S., Huang, Z., Karpathy, A., Khosla, A., Bernstein, M., et al. (2015) · International Journal of Computer Vision · doi:10.1007/s11263-015-0816-y · Cited by 39,380 · cited 2× · see citing works
“More specifically, the model zoo contains 15 models trained on ImageNet [39] by various algorithms, e.g., supervised learning (Sup-100%), semi-supervised learning (Semi-rotation-10% and Semi-exemplar-10% [40]), self-supervised learning (Rotation [41] and Jigsaw [42]), generative method (Cond-biggan…”
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,890 · see citing works
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387 · cited 1× · see citing works
“Illustration of three different transfer learning settings, i.e., transductive domain adaptation [6], cross-task transfer [7], and cross-domain cross-task transfer we investigating. tasks are unrelated or if the transferred representation does not carry sufficient information about the target task,…”
Auto-Encoding Variational Bayes
Kingma, D. P., & Welling, M. (2013) · arXiv · doi:10.48550/arxiv.1312.6114 · Cited by 20,067 · see citing works
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
Finn, C., Abbeel, P., & Levine, S. (2017) · arXiv · doi:10.48550/arxiv.1703.03400 · Cited by 8,512 · cited 3× · see citing works
“On the other hand, the vanilla finetune method even outperforms existing representative few-shot learning approaches including ProtoNet [55], MatchingNet [54], MAML [53], and Rela-Fig.”
How transferable are features in deep neural networks?
Yosinski, J., Clune, J., Bengio, Y., & Lipson, H. (2014) · arXiv · doi:10.48550/arxiv.1411.1792 · Cited by 6,061 · cited 2× · see citing works
“As empirical transferability studies [16], [17], [18], [19], [24] incur heavy computational burdens in retraining the transfer learning model on the target training data, a new 2162-237X © 2024 IEEE.”
A NEW MEASURE OF RANK CORRELATION
Kendall, M. G. (1938) · Biometrika · doi:10.1093/biomet/30.1-2.81 · Cited by 5,988 · cited 1× · see citing works
“…of transferability metrics, we adopt the commonly used Spearman’s rank correlation coefficient (Spearman’s ρ coefficient) and the Kendall rank correlation coefficient (Kendall’s τ coefficient) [35] to assess the correlation between the transfer accuracy and predicted transferability scores.”
Matching Networks for One Shot LearningPreprint
Vinyals, O., Blundell, C., Lillicrap, T., Kavukcuoglu, K., & Wierstra, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.04080 · Cited by 4,874 · cited 4× · see citing works
“1) Task Generation: Specifically, we generate few-shot target tasks using the character recognition dataset Omniglot [57] and the natural image classification dataset MiniIma-geNet [54], which are commonly used benchmarks in few-shot learning.”
InfluentialLarge Scale GAN Training for High Fidelity Natural Image Synthesis
Brock, A., Donahue, J., & Simonyan, K. (2018) · arXiv · doi:10.48550/arxiv.1809.11096 · Cited by 3,717 · cited 1× · see citing works
“…model zoo contains 15 models trained on ImageNet [39] by various algorithms, e.g., supervised learning (Sup-100%), semi-supervised learning (Semi-rotation-10% and Semi-exemplar-10% [40]), self-supervised learning (Rotation [41] and Jigsaw [42]), generative method (Cond-biggan [43]), and VAEs [44].”
A theory of learning from different domains
Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., & Vaughan, J. W. (2010) · Machine Learning · doi:10.1007/s10994-009-5152-4 · Cited by 3,515 · cited 1× · see citing works
“The “when to transfer” problem was traditionally studied theoretically through the derivation of generalization bounds of transfer learning across tasks [8], [9] and across domains (also known as the domain adaptation problem) [10], [11], [12], [13], [14], [15].”
Automated Flower Classification over a Large Number of Classes
Nilsback, M.-E., & Zisserman, A. (2008) · 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing · doi:10.1109/icvgip.2008.47 · Cited by 3,442 · cited 1× · see citing works
“Mean-while, VTAB provides the transfer accuracy of these models on seven target datasets including Caltech101 [45], CIFAR-100 [46], DTD [47], Flowers102 [48], Pets [49], SVHN [50], and Camelyon [51].”
One-shot learning of object categories
Fei-Fei, L., Fergus, R., & Perona, P. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.79 · Cited by 3,029 · cited 2× · see citing works
“Mean-while, VTAB provides the transfer accuracy of these models on seven target datasets including Caltech101 [45], CIFAR-100 [46], DTD [47], Flowers102 [48], Pets [49], SVHN [50], and Camelyon [51].”
Adapting visual category models to new domains
Saenko, K., Kulis, B., Fritz, M., & Darrell, T. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_16 · Cited by 2,847 · cited 1× · see citing works
“1) Datasets: Our experiments are conducted on the data from the largest-to-date cross-domain dataset DomainNet [33] and popular Office31 [34] dataset.”
Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles
Noroozi, M., & Favaro, P. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46466-4_5 · Cited by 2,775 · cited 1× · see citing works
“…model zoo contains 15 models trained on ImageNet [39] by various algorithms, e.g., supervised learning (Sup-100%), semi-supervised learning (Semi-rotation-10% and Semi-exemplar-10% [40]), self-supervised learning (Rotation [41] and Jigsaw [42]), generative method (Cond-biggan [43]), and VAEs [44].”
Unsupervised Representation Learning by Predicting Image Rotations
Gidaris, S., Singh, P., & Komodakis, N. (2018) · arXiv · doi:10.48550/arxiv.1803.07728 · Cited by 2,477 · cited 1× · see citing works
“…model zoo contains 15 models trained on ImageNet [39] by various algorithms, e.g., supervised learning (Sup-100%), semi-supervised learning (Semi-rotation-10% and Semi-exemplar-10% [40]), self-supervised learning (Rotation [41] and Jigsaw [42]), generative method (Cond-biggan [43]), and VAEs [44].”
Describing Textures in the Wild
Cimpoi, M., Maji, S., Kokkinos, I., Mohamed, S., & Vedaldi, A. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.461 · Cited by 2,438 · see citing works
Sinkhorn Distances: Lightspeed Computation of Optimal TransportPreprint
Cuturi, M. (2013) · Cited by 2,385 · see citing works
Computational Optimal Transport with Applications to Data Sciences
Gabriel Peyré, A., & Cuturi, M. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000073 · Cited by 2,354 · see citing works
Analysis of Representations for Domain Adaptation
Ben-David, S., Blitzer, J., Crammer, K., & Pereira, F. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0022 · Cited by 2,019 · cited 1× · see citing works
“The “when to transfer” problem was traditionally studied theoretically through the derivation of generalization bounds of transfer learning across tasks [8], [9] and across domains (also known as the domain adaptation problem) [10], [11], [12], [13], [14], [15].”
Moment Matching for Multi-Source Domain Adaptation
Peng, X., Bai, Q., Xia, X., Huang, Z., Saenko, K., & Wang, B. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00149 · Cited by 1,731 · cited 1× · see citing works
“1) Datasets: Our experiments are conducted on the data from the largest-to-date cross-domain dataset DomainNet [33] and popular Office31 [34] dataset.”
Parkhi, O., Vedaldi, A., Zisserman, A., & Jawahar, C. V. (2012) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2012.6248092 · Cited by 1,563 · see citing works
Meta-Transfer Learning for Few-Shot Learning
Sun, Q., Liu, Y., Chua, T., & Schiele, B. (2019) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2019.00049 · Cited by 1,366 · cited 1× · see citing works
“T RANSFER learning is an effective learning paradigm to enhance the performance on target tasks via leveraging prior knowledge from the related source tasks (or source models), especially when there are only a few labeled data for supervision [1], [2], [3], [4].”
Fine-Grained Visual Classification of AircraftPreprint
Maji, S., Rahtu, E., Kannala, J., Blaschko, M. B., & Vedaldi, A. (2013) · HAL · doi:10.48550/arxiv.1306.5151 · Cited by 1,250 · cited 1× · see citing works
“…of the OTCE-based URL algorithm on the popular metadataset [60] benchmark, which contains eight training domains (datasets), such as ImageNet [39], Omniglot [57], and Aircraft [61] and five testing domains including TrafficSign [62], MS-COCO [63], MNIST [58], CIFAR-10 [46], and CIFAR-100 [46].”
Taskonomy: Disentangling Task Transfer Learning
Zamir, A. R., Sax, A., Shen, W., Guibas, L., Malik, J., & Savarese, S. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00391 · Cited by 1,128 · see citing works
Detection of traffic signs in real-world images: The German traffic sign detection benchmark
Houben, S., Stallkamp, J., Salmen, J., Schlipsing, M., & Igel, C. (2013) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2013.6706807 · Cited by 1,003 · cited 1× · see citing works
“…of the OTCE-based URL algorithm on the popular metadataset [60] benchmark, which contains eight training domains (datasets), such as ImageNet [39], Omniglot [57], and Aircraft [61] and five testing domains including TrafficSign [62], MS-COCO [63], MNIST [58], CIFAR-10 [46], and CIFAR-100 [46].”
Transfer Learning for Visual Categorization: A Survey
Shao, L., Zhu, F., & Li, X. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2330900 · Cited by 895 · cited 1× · see citing works
“T RANSFER learning is an effective learning paradigm to enhance the performance on target tasks via leveraging prior knowledge from the related source tasks (or source models), especially when there are only a few labeled data for supervision [1], [2], [3], [4].”
S4L: Self-Supervised Semi-Supervised Learning
Zhai, X., Oliver, A., Kolesnikov, A., & Beyer, L. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00156 · Cited by 768 · cited 1× · see citing works
“…model zoo contains 15 models trained on ImageNet [39] by various algorithms, e.g., supervised learning (Sup-100%), semi-supervised learning (Semi-rotation-10% and Semi-exemplar-10% [40]), self-supervised learning (Rotation [41] and Jigsaw [42]), generative method (Cond-biggan [43]), and VAEs [44].”
Similarity of Neural Network Representations Revisited
Kornblith, S., Norouzi, M., Lee, H., & Hinton, G. (2019) · arXiv · doi:10.48550/arxiv.1905.00414 · Cited by 724 · cited 1× · see citing works
“Therefore, we propose to replace the knowledge distillation objective centered kernel alignment (CKA) [32] similarity used in URL with our F-OTCE metric, as illustrated in Fig.”
One shot learning of simple visual concepts
Lake, B. M., Salakhutdinov, R., Gross, J. N., & Tenenbaum, J. B. (2011) · eScholarship (California Digital Library) · Cited by 677 · see citing works
Miscible Displacement of Heavy West Sak Crude by Solvents in Slim Tube
Sharma, A. K., Patil, S., KAMATH, V. A., & Sharma, G. D. (1989) · SPE California Regional Meeting · doi:10.2118/18761-ms · Cited by 559 · see citing works
Domain Adaptation: Learning Bounds and Algorithms
Mansour, Y., Mohri, M., & Rostamizadeh, A. (2009) · arXiv · doi:10.48550/arxiv.0902.3430 · Cited by 504 · cited 1× · see citing works
“The “when to transfer” problem was traditionally studied theoretically through the derivation of generalization bounds of transfer learning across tasks [8], [9] and across domains (also known as the domain adaptation problem) [10], [11], [12], [13], [14], [15].”
Rotation Equivariant CNNs for Digital Pathology
Veeling, B. S., Linmans, J., Winkens, J., Cohen, T., & Welling, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-00934-2_24 · Cited by 476 · see citing works
Zhang, W., Deng, L., Zhang, L., & Wu, D. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.106004 · Cited by 457 · cited 2× · see citing works
“Inthisarticle, we mainly investigate the transferability estimation problem with two representative transfer paradigms for neural networks [5], i.e., Retrain head and Finetune .”
Exploiting Task Relatedness for Multiple Task Learning
Ben-David, S., & Schuller, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_41 · Cited by 432 · cited 1× · see citing works
“The “when to transfer” problem was traditionally studied theoretically through the derivation of generalization bounds of transfer learning across tasks [8], [9] and across domains (also known as the domain adaptation problem) [10], [11], [12], [13], [14], [15].”
Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few ExamplesPreprint
Triantafillou, E., Zhu, T., Dumoulin, V., Lamblin, P., Evci, U., Xu, K., Goroshin, R., Gelada, C., Swersky, K., Manzagol, P.-A., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.03096 · Cited by 428 · cited 1× · see citing works
“G. Evaluation on OTCE-Based URL Algorithm 1) Dataset: We conduct the evaluations of the OTCE-based URL algorithm on the popular metadataset [60] benchmark, which contains eight training domains (datasets), such as ImageNet [39], Omniglot [57], and Aircraft [61] and five testing domains including…”
Learning Bounds for Domain Adaptation
Blitzer, J. C., Crammer, K., Kulesza, A., Pereira, F. M. B., & Wortman, J. R. (2007) · Cited by 386 · see citing works
Learning Generative Models with Sinkhorn DivergencesPreprint
Genevay, A., Gabriel Peyré, A., & Cuturi, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.00292 · Cited by 341 · cited 1× · see citing works
“The computation of solving the OT problem with entropic regularizer [28] (4) is differentiable [30] since the iterations form a sequence of linear operations, so it can be implemented on the PyTorch framework as a specialized layer 1 of the neural network.”
(1992) · Cited by 316 · see citing works
Transfer adaptation learning: A decade survey
Zhang, L., & Gao, X. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3183326 · Cited by 314 · cited 1× · see citing works
“T RANSFER learning is an effective learning paradigm to enhance the performance on target tasks via leveraging prior knowledge from the related source tasks (or source models), especially when there are only a few labeled data for supervision [1], [2], [3], [4].”
A Large-scale Study of Representation Learning with the Visual Task Adaptation BenchmarkPreprint
Zhai, X., Puigcerver, J., Kolesnikov, A., Ruyssen, P., Riquelme, C., Lučić, M., Djolonga, J., Pinto, A. S., Neumann, M., Dosovitskiy, A., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.04867 · Cited by 249 · cited 1× · see citing works
“In this exper-iment, we evaluate the effectiveness of transferability metrics in source model selection using the visual task adaptation benchmark (VTAB) [38].”
Task2Vec: Task Embedding for Meta-Learning
Achille, A., Lam, M., Tewari, R., Ravichandran, A., Maji, S., Fowlkes, C. C., Soatto, S., & Perona, P. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00653 · Cited by 210 · cited 2× · see citing works
“As empirical transferability studies [16], [17], [18], [19], [24] incur heavy computational burdens in retraining the transfer learning model on the target training data, a new 2162-237X © 2024 IEEE.”
Domain Adaptation With Neural Embedding Matching
Wang, Z., Du, B., & Guo, Y. (2019) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2935608 · Cited by 184 · cited 1× · see citing works
“The “when to transfer” problem was traditionally studied theoretically through the derivation of generalization bounds of transfer learning across tasks [8], [9] and across domains (also known as the domain adaptation problem) [10], [11], [12], [13], [14], [15].”
Rethinking Maximum Mean Discrepancy for Visual Domain Adaptation
Wang, W., Li, H., Ding, Z., Nie, F., Chen, J., Dong, X. M., & Wang, Z. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3093468 · Cited by 178 · cited 1× · see citing works
“The “when to transfer” problem was traditionally studied theoretically through the derivation of generalization bounds of transfer learning across tasks [8], [9] and across domains (also known as the domain adaptation problem) [10], [11], [12], [13], [14], [15].”
Transferability and Hardness of Supervised Classification Tasks
Tran, A. T., Nguyen, C. V., & Hassner, T. (2019) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00148 · Cited by 141 · cited 6× · see citing works
“Despite being evidently more efficient in computing from practical data than empirical methods, they are also prone to strict data assumptions [7], [20] and insufficient performance [21], [23], while task complexities are similar.”
InfluentialTransfer Learning via Learning to Transfer.
Wei, Y., Zhang, Y., Huang, J., & Yang, Q. (2018) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 126 · see citing works
An Information-Theoretic Approach to Transferability in Task Transfer Learning
Bao, Y., Li, Y., Huang, S., Zhang, L., Zheng, L., Zamir, A., & Guibas, L. J. (2019) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2019.8803726 · Cited by 120 · cited 5× · see citing works
“Despite being evidently more efficient in computing from practical data than empirical methods, they are also prone to strict data assumptions [7], [20] and insufficient performance [21], [23], while task complexities are similar.”
InfluentialSelf-citationLEEP: A New Measure to Evaluate Transferability of Learned RepresentationsPreprint
Nguyen, C. V., Hassner, T., Seeger, M., & Archambeau, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.12462 · Cited by 117 · cited 4× · see citing works
“Quantitative comparisons with state-of-the-art auxiliary-free transferability metrics including LEEP [21], NCE [20], H-score [7], and LogME [23] are shown in Table II, and visual comparisons are illustrated in Fig.”
InfluentialUniversal Representation Learning from Multiple Domains for Few-shot Classification
Li, W., Liu, X., & Bilen, H. (2021) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.00939 · Cited by 102 · cited 4× · see citing works
“Please refer to [31] and [27] and the official codebase 2 for more details about the URL algorithm.”
InfluentialGeometric Dataset Distances via Optimal TransportPreprint
Alvarez-Melis, D., & Fusi, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.02923 · Cited by 100 · cited 1× · see citing works
“Inspired by recent work [29], we compute the label distance as the Wasserstein distance Wass (α y s , α y t ) .”
LogME: Practical Assessment of Pre-trained Models for Transfer LearningPreprint
You, K., Liu, Y., Wang, J., & Long, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.11005 · Cited by 87 · cited 4× · see citing works
“Quantitative comparisons with state-of-the-art auxiliary-free transferability metrics including LEEP [21], NCE [20], H-score [7], and LogME [23] are shown in Table II, and visual comparisons are illustrated in Fig.”
InfluentialDualNet: Learn Complementary Features for Image Recognition
Hou, S., Liu, X., & Wang, Z. (2017) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.62 · Cited by 83 · cited 1× · see citing works
“When multiple source models are accessible, one can transfer them to a target task by merging their inferred features to obtain a fused feature representation [52].”
Transfer bounds for linear feature learning
Maurer, A. (2009) · Machine Learning · doi:10.1007/s10994-009-5109-7 · Cited by 79 · cited 1× · see citing works
“The “when to transfer” problem was traditionally studied theoretically through the derivation of generalization bounds of transfer learning across tasks [8], [9] and across domains (also known as the domain adaptation problem) [10], [11], [12], [13], [14], [15].”
Faster Wasserstein Distance Estimation with the Sinkhorn DivergencePreprint
Chizat, L., Roussillon, P., Léger, F., Vialard, F., & Gabriel Peyré, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.08172 · Cited by 70 · cited 1× · see citing works
“Solving the OT problem by Sinkhorn algorithm with ϵ accuracy has complexity O ( mnk ) = O ( 2 mn ∥ c ∥ 2 /(λϵ)) [37], where ∥ c ∥ ∞ = sup ( z s , z t ) ∈ Z 2 c ( z s , z t ) is the maximum cost between source and target sample features and λ is the weighting coefficient of the entropic regularizer.”
OTCE: A Transferability Metric for Cross-Domain Cross-Task Representations
Yang, T., Li, Y., & Huang, S. (2021) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr46437.2021.01552 · Cited by 62 · see citing works
Self-citationBalancing Transferability and Discriminability for Unsupervised Domain Adaptation
Huang, J., Xiao, N., & Zhang, L. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3201623 · Cited by 40 · cited 1× · see citing works
“As empirical transferability studies [16], [17], [18], [19], [24] incur heavy computational burdens in retraining the transfer learning model on the target training data, a new 2162-237X © 2024 IEEE.”
Universal Representations: A Unified Look at Multiple Task and Domain Learning
Li, W., Liu, X., & Bilen, H. (2023) · International Journal of Computer Vision · doi:10.1007/s11263-023-01931-6 · Cited by 32 · cited 2× · see citing works
“Please refer to [31] and [27] and the official codebase 2 for more details about the URL algorithm.”
Flagged first, then by citations
3 of the 62 references couldn’t be matched to a known paper.
Research works printed but not linked: 5
- L. Kantorovich, "On the translocation of masses, cr (dokl.) acad," Sci. URSS (NS), vol. 37, p. 199, 1942.
- Y. Netzer, T. Wang, A. Coates, A. Bissacco, B. Wu, and A. Y. Ng, "Reading digits in natural images with unsupervised feature learning," in NIPS Workshop on Deep Learning and Unsupervised Feature Learning 2011, 2011.
- J. Snell, K. Swersky, and R. Zemel, "Prototypical networks for few-shot learning," Advances in Neural Information Processing Systems, vol. 30, pp. 4077-4087, 2017.
- F. Sung, Y. Yang, L. Zhang, T. Xiang, P. H. Torr, and T. M. Hospedales, "Learning to compare: Relation network for few-shot learning," in Proceedings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 1199-1208.
- Y. LeCun, C. Cortes, and C. Burges, "Mnist handwritten digit database," ATT Labs [Online]. Available: http://yann.lecun.com/exdb/mnist, vol. 2, 2010.
Cited by
Sorted by citations
Rather, I. H., Kumar, S., & Gandomi, A. H. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10859-3 · Cited by 131 · see citing works
Deep transfer learning for image classification: a survey
Plested, J., Phiri, M., & Gedeon, T. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-026-11491-z · Cited by 74 · see citing works
“It is, therefore, imperative to find efficient transferability metrics that can accurately estimate empirical transferability [170].”
A Review on Transferability Estimation in Deep Transfer Learning
Xue, Y., Yang, R., Chen, X., Liu, W., Wang, Z., & Liu, X. (2024) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2024.3445892 · Cited by 26 · see citing works
Wasserstein task embedding for measuring task similarities
Liu, X., Bai, Y., Lu, Y., Soltoggio, A., & Kolouri, S. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106796 · Cited by 16 · see citing works
Exploring geo-transferability of deep neural network by developing comprehensive metrics
Yu, J., Tu, W., Chen, X., Li, M., Chen, D., Cao, R., & Li, Q. (2025) · Geo-spatial Information Science · doi:10.1080/10095020.2025.2505551 · Cited by 6 · see citing works
Evolving from Single-modal to Multi-modal Facial Deepfake Detection: Progress and Challenges
Liu, P., Tao, Q., & Zhou, J. T. (2024) · arXiv · doi:10.48550/arxiv.2406.06965 · Cited by 6 · see citing works
“Prior research on domain adaptation [258] and domain generalization [259] highlights this issue but often lacks comprehensive, practical strategies tailored specifically for deepfake detection.”
Adaptive Fine-Tuning in Degradation-Time-Series Forecasting via Generating Source Domain
Pan, J., Jin, B., Wang, S., Yuwen, X., & Jiao, X. (2023) · IEEE Access · doi:10.1109/access.2023.3341159 · Cited by 5 · see citing works
A Transferability-Based Method for Evaluating the Protein Representation Learning
Hu, F., Zhang, W., Huang, H., Wang, L., Li, Y., & Yin, P. (2024) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2024.3370680 · Cited by 4 · see citing works
Self-citationLi, L., Tang, Q., Sun, K., & Chen, G. (2025) · Measurement Science and Technology · doi:10.1088/1361-6501/adf7c9 · Cited by 3 · see citing works
“While transfer learning reduces dependence on target domain labels, its reliance on source domain labels limits its effectiveness when domain divergence is substantial [21].”
Islam, A., Masuduzzaman, M., & Shin, S. Y. (2025) · Internet of Things · doi:10.1016/j.iot.2025.101659 · Cited by 2 · see citing works
Bridging the gap between computer vision and bioelectrical signal analysis
Wang, Y., Hu, S., Liu, J., Wang, A., Zhou, G., & Yang, C. (2025) · Information Fusion · doi:10.1016/j.inffus.2025.104047 · Cited by 2 · see citing works
Wang, J., Xie, L., Xie, Y., Huang, S., & Li, Y. (2024) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2024.3434498 · Cited by 1 · see citing works
“Achieving good performances on all given domains thus results in a generalizable model [14].”
Self-citationDeep Transfer Recommendation Model with Spatio-Temporal Enhancement and Adaptive Gating Fusion
Chen, H. (2025) · International Conference on Advanced Algorithms and Control Engineering (ICAACE) · doi:10.1109/icaace65325.2025.11019110 · Cited by 1 · see citing works
“Tan et al. [6] trained multiple expert models to learn the differences between the source and target domains, and used a hybrid strategy to fuse the prediction results.”
Cross-discipline cold-start knowledge tracing via overlapping entities and contrastive learning
Deng, Y., Guan, Z., He, M., Wang, X., Liu, J., Li, Z., & Yang, Z. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.114616 · Cited by 1 · see citing works
Ayana, G., Park, S.-Y., Jeong, K. C., Yoon, S.-D., & Choe, S. (2026) · Scientific Reports · doi:10.1038/s41598-026-42157-z · Cited by 1 · see citing works
“NCE can be computed as follows to measure the transferability between source model θ and target model D 61 .”
Multi-domain generalization few-shot intent recognition with dual representation learning
Yanga, S., & Dua, Y. (2026) · Information Processing & Management · doi:10.1016/j.ipm.2026.104781 · Cited by 1 · see citing works
Wang, J., Yu, Q., Zhang, R., & Xiao, N. (2026) · Remote Sensing · doi:10.3390/rs18101572 · Cited by 1 · see citing works
Graph-guided Source Selection with Sequential Transfer for Medical Image Segmentation
Yang, J., Zhang, G., Wang, J., & Li, Y. (2024) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm62325.2024.10821855
Self-citationWang, J., Tan, Y., Wang, H., & Li, Y. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.107708
Self-citationMa, Y., Qian, H., & Li, W. (2026) · Electronics · doi:10.3390/electronics15061242
A homomorphic encryption-based privacy preservation for adaptive quantum cross-task optimization
Fang, L., Deng, N., Luo, X., Xu, Y., Liu, D., & Lin, F. (2026) · Cybersecurity · doi:10.1186/s42400-026-00593-4
“Further efforts, including task transferability-driven regulation frameworks (Tan et al. 2024; Ban et al. 2025) and validation in unstructured task spaces for soft robotics (Zhao et al. 2025), demonstrate progress but remain constrained by reliance on full-space parameter sharing and insufficient…”
Xie, C. (2026) · IEEE International Conference on Control, Electronics and Computer Technology (ICCECT) · doi:10.1109/iccect68671.2026.11565427
“MAML-based approaches learn general hyperparameter initialization strategies, significantly reducing tuning costs for new tasks [20].”
CNN-Enhanced Transformer with Transfer Learning for Cross-Session Monkey Motor Neural Decoding
Wu, M., Gao, T., Ren, Y. Q., Dai, Y., Huang, S., & Zhang, J. (2026) · Electronics · doi:10.3390/electronics15132881
Self-citationZhi, Y., Yu, K., Cui, Q., Li, X., & Tao, X. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11586991
“The strong data heterogeneity among different satellites means that performing point-to-point transfer learning typically fails to provide local models with satisfactory benefit, necessitating the selection of more suitable migration sources [6].”
Xi, B., Wen, X., Tan, X., Li, J., Li, Y., Li, Z., & Gamba, P. E. (2026) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2026.3733406
“Concurrently, discrepancy-based approaches focus on explicitly minimizing statistical divergences, such as optimal transport or maximum mean discrepancy, across distinct domains [42].”
Self-citation
- Authors
- Tan, Y., Zhang, E., Li, Y., Huang, S.-L., & Zhang, X.-P.
- Affiliations
- Tsinghua Shenzhen International Graduate School (CN)
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2025-02
- Volume
- 36
- Issue
- 2
- Pages
- 2423-2436
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W4391547566
- Cited by
- 24
- References
- 62
- Citations by year
- 2026: 10 · 2025: 7 · 2024: 6 · 2023: 1
- FWCI
- 3.39
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Neural Networks and Learning Systems (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by-nc-nd)
- arXiv (Cornell University)
- Funders
- National Natural Science Foundation of China (62371270)
- Tsinghua Shenzhen International Graduate School (SIGS) Scientific Research Start-Up Fund (QD2021012C)
- Shenzhen Key Laboratory of Ubiquitous Data Enabling (ZDSYS20220527171406015)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Keywords
- optimal transport, conditional entropy, domain generalization, model finetuning, few-shot classification
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review