A convergence algorithm for graph co-regularized transfer learning

Transfer learning is an important technology in addressing the problem that labeled data in a target domain are difficult to collect using extensive labeled data from the source domain. Recently, an algorithm named graph co-regularized transfer learning (GTL) has shown a competitive performance in t...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2023-03, Vol.66 (3), p.132104, Article 132104
Main Authors: Yang, Zuyuan, Liang, Naiyao, Li, Zhenni, Xie, Shengli
Format: Article
Language:English
Subjects:
Algorithms
Computer Science
Convergence
Datasets
Domains
Information Systems and Communication Service
Machine learning
Research Paper
Synthetic data
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Transfer learning is an important technology in addressing the problem that labeled data in a target domain are difficult to collect using extensive labeled data from the source domain. Recently, an algorithm named graph co-regularized transfer learning (GTL) has shown a competitive performance in transfer learning. However, its convergence is affected by the used approximate scheme, degenerating learned results. In this paper, after analyzing convergence conditions, we propose a novel update rule using the multiplicative update rule and develop a new algorithm named improved GTL (IGTL) with a strict convergence guarantee. Moreover, to prove the convergence of our method, we design a special auxiliary function whose value is intimately related to that of the objective function. Finally, the experimental results on the synthetic dataset and two real-world datasets confirm that the proposed IGTL is convergent and performs better than the compared methods.
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-020-3526-4