Cited by 25Domain Adaptation and Few-Shot LearningAdvanced Neural Network ApplicationsMachine Learning and Data Classification

Transferability-Guided Cross-Domain Cross-Task Transfer Learning

Open access
Tan, Yang, Zhang, Enming, Li, Yang, Huang, Shao-Lun, Zhang, Xiao-Ping·2025·IEEE Transactions on Neural Networks and Learning Systems

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnnls.2024.3358094

Cites

59 of 59 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

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

  1. L. Kantorovich, "On the translocation of masses, cr (dokl.) acad," Sci. URSS (NS), vol. 37, p. 199, 1942.
  2. 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.
  3. 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.
  4. 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.
  5. 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

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
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