Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kaizhong Jin

dblp:261/3533 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Transfer learning and domain adaptation · 100%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › distribution matching
correlation alignment
0.512021
Differentially Private Correlation Alignment for Domain Adaptation · IJCAI 2021
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.512021
Differentially Private Correlation Alignment for Domain Adaptation · IJCAI 2021
Privacy and data protection
differential privacy
0.512021
Differentially Private Correlation Alignment for Domain Adaptation · IJCAI 2021

Methods — techniques the papers use, named apart from their topics

random subspace ensemble · 1.0differential privacy · 1.0covariance estimation · 1.0
YearPublicationVenuePosition
2022 Differentially Private Distributed Multi-Task Relationship Learning
abstract
In many real-world applications, data are distributed across different geographical regions, and may come from different distributions which result in multiple learning tasks. In such cases, distributed multi-task learning is usually used to learn the multiple related tasks to improve the generalization performance for each task. Among the distributed multi-task learning algorithms, distributed multi-task relationship learning (DMTRL) attracts much attention in the community as it learns task relationships from data, instead of imposing a prior task relatedness assumption. To perform DMTRL, task model or its gradient is transferred between task node and central server. There will be a potential privacy violation when the distributed data are possessed by different institutes and contain sensitive information (e.g., medical records). In this paper, we propose a distributed multi-task relationship learning approach under differential privacy called DRUPE, where privacy protection is achieved through perturbing the gradients at each task node. In particular, to reduce the high variance of the perturbed gradients and achieve fast convergence rate, we develop a variance reduction based gradient calibration method, which first estimates the gradient error from the previous perturbed gradients and then calibrates the current perturbed gradient by subtracting the gradient error term. Moreover, to alleviate the negative effect caused by the inaccurate task relationships that are inferred from the private task models, we present a task relationship calibration method which uses the least-squares approximation algorithm to calibrate the inaccurate pairwise relationships between the tasks. Experimental results on real-world datasets confirm the effectiveness of our approach.
Kaizhong Jin, Xiang Cheng 0003
ICCCN1
2021 Differentially Private Correlation Alignment for Domain Adaptation
abstract
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. As a simple and efficient method for domain adaptation, correlation alignment transforms the distribution of the source domain by utilizing the covariance matrix of the target domain, such that a model trained on the transformed source data can be applied to the target data. However, when source and target domains come from different institutes, exchanging information between the two domains might pose a potential privacy risk. In this paper, for the first time, we propose a differentially private correlation alignment approach for domain adaptation called PRIMA, which can provide privacy guarantees for both the source and target data. In PRIMA, to relieve the performance degradation caused by perturbing the covariance matrix in high dimensional setting, we present a random subspace ensemble based covariance estimation method which splits the feature spaces of source and target data into several low dimensional subspaces. Moreover, since perturbing the covariance matrix may destroy its positive semi-definiteness, we develop a shrinking based method for the recovery of positive semi-definiteness of the covariance matrix. Experimental results on standard benchmark datasets confirm the effectiveness of our approach.
Kaizhong Jin, Xiang Cheng 0003, Kaiyuan Shen
IJCAI1