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

Zhiyu Ye

dblp:359/0061 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
3 papers
Transfer learning and domain adaptation · 40% Efficient and distributed learning · 30% Trustworthy machine learning · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › domain adaptation › source-free domain adaptation
black-box domain adaptation
0.912025
ADU: Adaptive Detection of Unknown Categories in Black-Box Domain Adaptation · CVPR 2025
Machine learning › Transfer learning and domain adaptation › domain adaptation › continual domain adaptation
class-incremental domain adaptation
0.912025
Quantifying Samples with Invariance for Source-Free Class Incremental Domain Adaptation · ACM Multimedia 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
SPFL: Sequential updates with Parallel aggregation for Enhanced Federated Learning under Category and Domain Shifts · NeurIPS 2025
Computer vision › Image recognition and object detection
image classification
0.912025
Quantifying Samples with Invariance for Source-Free Class Incremental Domain Adaptation · ACM Multimedia 2025
Machine learning › Efficient and distributed learning › federated learning › data heterogeneity
non-IID federated learning
0.912025
SPFL: Sequential updates with Parallel aggregation for Enhanced Federated Learning under Category and Domain Shifts · NeurIPS 2025
Machine learning › Trustworthy machine learning › open-world recognition
open-set recognition
0.912025
ADU: Adaptive Detection of Unknown Categories in Black-Box Domain Adaptation · CVPR 2025
Machine learning › Efficient and distributed learning › federated learning
sequential federated learning
0.912025
SPFL: Sequential updates with Parallel aggregation for Enhanced Federated Learning under Category and Domain Shifts · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation › domain adaptation
source-free domain adaptation
0.912025
Quantifying Samples with Invariance for Source-Free Class Incremental Domain Adaptation · ACM Multimedia 2025
Machine learning › Trustworthy machine learning › open-world recognition › open-set recognition
unknown class detection
0.912025
ADU: Adaptive Detection of Unknown Categories in Black-Box Domain Adaptation · CVPR 2025
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.912025
ADU: Adaptive Detection of Unknown Categories in Black-Box Domain Adaptation · CVPR 2025

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

sequential updates · 0.9semantic restructuring · 0.9parallel aggregation · 0.9knowledge distillation · 0.9invariance quantification · 0.9experience replay · 0.9entropy-driven label differentiation · 0.9convergence analysis · 0.9adaptive thresholding · 0.9
YearPublicationVenuePosition
2025 ADU: Adaptive Detection of Unknown Categories in Black-Box Domain Adaptation
abstract
Black-box Domain Adaptation (BDA) utilizes a black-box predictor of the source domain to label target domain data, addressing privacy concerns in Unsupervised Domain Adaptation (UDA). However, BDA assumes identical label sets across domains, which is unrealistic. To overcome this limitation, we propose a study on BDA with unknown classes in the target domain. It uses a black-box predictor to label target data and identify "unknown" categories, without requiring access to source domain data or predictor parameters, thus addressing both data privacy and category shift issues in traditional UDA. Existing methods face two main challenges: (i) Noisy pseudo-labels in knowledge distillation (KD) accumulate prediction errors, and (ii) relying on a preset threshold fails to adapt to varying category shifts. To address these, we propose ADU, a framework that allows the target domain to autonomously learn pseudo-labels guided by quality and use an adaptive threshold to identify "unknown" categories. Specifically, ADU consists of Selective Amplification Knowledge Distillation (SAKD) and Entropy-Driven Label Differentiation (EDLD). SAKD improves KD by focusing on high-quality pseudo-labels, mitigating the impact of noisy labels. EDLD categorizes pseudo-labels by quality and applies tailored training strategies to distinguish "unknown" categories, improving detection accuracy and adaptability. Extensive experiments show that ADU achieves state-of-the-art results, outperforming the best existing method by 3.1% on VisDA in the OPBDA scenario.
Yushan Lai, Haoyuan Liang, Juepeng Zheng, Zhiyu Ye
CVPR5
2025 Quantifying Samples with Invariance for Source-Free Class Incremental Domain Adaptation
abstract
In response to the growing demands of real-world applications, models must be capable of learning continuously under inconsistent data distribution. However, existing Class-Incremental (CI) methods fail to alleviate domain shifts, while traditional Unsupervised Domain Adaptation (UDA) techniques suffer from catastrophic forgetting and privacy concerns. To address these limitations, we explore Source-Free Class Incremental Domain Adaptation (SFCIDA) and propose a novel approach, Quantifying Samples with Invariance (QSI), for this scenario. Our proposed method involves two main strategies: (1) Semantic Restructuring. We identify confusing source category pairs and restructure images to create a negative dataset that is semantically similar to the source features, refining accurate decision boundary among source categories. (2) Invariance Quantification. The sample's confidence is then quantified by its spatial location under the special data distribution, reflecting the trade-off between invariant features and domain shifts. Guided by such strategy, samples' confidence is accumulated for the target model to prioritize reliable categories, not only mitigating the poor performance of experience replay in unsupervised scenarios, but alleviating distribution discrepancies simultaneously. Experiments demonstrate that our approach outperforms previous methods, establishing new state-of-the-art performance on the Office-31, Office-Home and DomainNet-126 datasets, with average accuracy improvements of over 7.3%, 4.9% and 10.2% respectively.
Zhiyu Ye, Haoyuan Liang, Shilei Cao 0005, Yushan Lai, Juepeng Zheng
ACM Multimedia1
2025 SPFL: Sequential updates with Parallel aggregation for Enhanced Federated Learning under Category and Domain Shifts
abstract
Federated learning (FL) has recently emerged as the primary approach to overcoming data silos, enabling collaborative model training without sharing sensitive or proprietary data. Parallel federated learning (PFL) aggregates models trained independently on each client’s local data, which can lead to suboptimal convergence due to limited data exposure. In contrast, Sequential Federated Learning (SFL) allows models to traverse client datasets sequentially, enhancing data utilization. However, SFL effectiveness is limited in real-world non-IID scenarios characterized by category shift (inconsistent class distributions) and domain shift (distribution discrepancies). These shifts cause two critical issues: update order sensitivity, where model performance varies significantly with the sequence of client updates, and catastrophic forgetting, where the model forgets previously learned features when trained on new client data. We propose SPFL, a novel updating method that can be integrated into existing FL methods, integrating sequential updates with parallel aggregation to enhance data utilization and ease update order sensitivity. At the same time, we give the convergence analysis of SPFL under strong convex, general convex, and non-convex conditions, proving that this update scheme is significantly better than PFL and SFL. Additionally, we introduce the Global-Local Alignment Module to mitigate catastrophic forgetting by aligning the predictions of the global model with those of the local and previous models during training. Our extensive experiments demonstrate that integrating SPFL into existing PFL methods significantly improves performance under category and domain shifts.
Haoyuan Liang, Shilei Cao 0005, Zhiyu Ye, Haohuan Fu, Juepeng Zheng
NeurIPS4
2024 C2RG: Parameter-efficient Adaptation of 3D Vision and Language Foundation Model for Coronary CTA Report Generation
abstract
Medical report generation (MRG) is a challenging yet highly demanding task in the application of multi-modal artificial intelligence in medicine. Typically, training an MRG model requires tens of thousands of labelled radiology images and reports datasets, which could be impractical for most clinical research groups. In this study, we present C2RG, a novel 3D vision and language foundation model tailored for Coronary Computed Tomography Angiography (CTA) Report Generation. Inspired by BLIP-2’s architecture, our method integrates a self-supervised pre-trained 3D cardiac vision model (ViT-B) and a general-purpose bilingual foundation model (ChatGLM-6B), with a lightweight querying Transformer (Q-Former). We also introduce a parallel high-resolution feature extractor module and a coronary calcification evaluation loss to simultaneously encode fine-grained 3D features and constrain the accuracy of report generation. We compared our model with six state-of-the-art MRG methods on a clinical dataset with 118 subjects, comprising 453 paired 3D CTA images and radiology reports. Experimental results with extensive ablations show the efficacy of our C2RG. Codes will be open-sourced after the conference.
Zhiyu Ye, Bang Yang, Shibin Wu, Hancong Wang, Hairong Zheng, Tong Zhang 0017
BIBM1