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

Yiying Wang

dblp:231/2186 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2026
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 3 since 2021Systems, architecture and hardware · 1 · 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
2 papers
Efficient and distributed learning · 43% Graph learning · 38% Trustworthy machine learning · 19%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › invariance
causal invariance
1.012026
Transferable Graph Condensation from the Causal Perspective · AAAI 2026
Machine learning › Efficient and distributed learning
federated learning
1.012026
FedPKDA: Personalized Federated Learning with Privacy-Preserving Knowledge Dynamic Alignment · AAAI 2026
Machine learning › Graph learning › graph neural network › efficient graph neural network
graph condensation
1.012026
Transferable Graph Condensation from the Causal Perspective · AAAI 2026
Machine learning › Graph learning
graph representation learning
1.012026
Transferable Graph Condensation from the Causal Perspective · AAAI 2026
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
1.012026
FedPKDA: Personalized Federated Learning with Privacy-Preserving Knowledge Dynamic Alignment · AAAI 2026
Privacy and data protection
privacy-preserving machine learning
1.012026
FedPKDA: Personalized Federated Learning with Privacy-Preserving Knowledge Dynamic Alignment · AAAI 2026
Machine learning › Efficient and distributed learning › federated learning
heterogeneous federated learning
0.312026
FedPKDA: Personalized Federated Learning with Privacy-Preserving Knowledge Dynamic Alignment · AAAI 2026

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

prototype alignment · 2.0mahalanobis distance · 2.0laplacian noise · 2.0spectral-domain learning · 1.0contrastive learning · 1.0causal intervention · 1.0
YearPublicationVenuePosition
2026 Transferable Graph Condensation from the Causal Perspective
abstract
The increasing scale of graph datasets has significantly improved the performance of graph representation learning methods, but it has also introduced substantial training challenges. Graph dataset condensation techniques have emerged to compress large datasets into smaller yet information-rich datasets, while maintaining similar test performance. However, these methods strictly require downstream applications to match the original dataset and task, which often fails in cross-task and cross-domain scenarios. To address these challenges, we propose a novel causal-invariance-based and transferable graph dataset condensation method, named TGCC, providing effective and transferable condensed datasets. Specifically, to preserve domain-invariant knowledge, we first extract domain causal-invariant features from the spatial domain of the graph using causal interventions. Then, to fully capture the structural and feature information of the original graph, we perform enhanced condensation operations. Finally, through spectral-domain Enhanced contrastive learning, we inject the causal-invariant features into the condensed graph, ensuring that the compressed graph retains the causal information of the original graph. Experimental results on five public datasets and our novel FinReport dataset demonstrate that TGCC achieves up to a 13.41% improvement in cross-task and cross-domain complex scenarios compared to existing methods, and achieves state-of-the-art performance on 5 out of 6 datasets in the single dataset and task scenario.
Huaming Du, Su Yao, Yiying Wang, Yueyang Zhou, Jinshi Zhang, Yu Zhao 0019, Guisong Liu, Hegui Zhang, Carl Yang 0001, Gang Kou
AAAI4
2026 FedPKDA: Personalized Federated Learning with Privacy-Preserving Knowledge Dynamic Alignment
abstract
Personalized Federated Learning (PFL), which aims to customize models for each client while preserving data privacy, has become an important research topic in addressing the challenges of data heterogeneity. Existing studies usually enhance the localization of global parameters by injecting local information into the globally shared model. However, these methods focus excessively on the personalized characteristics of individual clients and fail to fully exploit distinctive information across clients, limiting the quality of local models to represent unseen samples well. To address this issue, we propose a novel personalized Federated Privacy-preserving Knowledge Dynamic Alignment (FedPKDA) framework, which ensures data privacy during both the collection of client-side key information and its incorporation into federated model training. Specifically, to ensure data privacy during the cross-client information collection phase, we first conduct feature clipping and add Laplacian noise to the local prototypes extracted from each client. Further, we compute the centroid of the uploaded local prototypes in a latent space and leverage Mahalanobis distance to guide the generation of global prototypes, thereby preserving the semantic contributions from participating clients. Moreover, to boost the personalization of the local model, we dynamically align representations learned by the shared model with both a set of local prototypes and privacy-preserving global prototypes, facilitating effective cross-client knowledge sharing under heterogeneous settings while preserving client-specific characteristics. Extensive experiments on benchmark datasets have verified the superiority of FedPKDA against its competitors.
Moxuan Zeng, Wenxuan Tu, Yiying Wang, Xiangyan Tang, Jieren Cheng
AAAI4
2025 DeepCA: Deep Learning-Based 3D Coronary Artery Tree Reconstruction from Two 2D Non-Simultaneous X-Ray Angiography Projections
abstract
Cardiovascular diseases (CVDs) are the most common cause of death worldwide. Invasive x-ray coronary angiography (ICA) is one of the most important imaging modalities for the diagnosis of CVDs. ICA typically acquires only two 2D projections, which makes the 3D geometry of coronary vessels difficult to interpret, thus requiring 3D coronary artery tree reconstruction from two projections. State-of-the-art approaches require significant manual interactions and cannot correct the non-rigid cardiac and respiratory motions between non-simultaneous projections. In this study, we propose a novel deep learning pipeline named DeepCA. We leverage the Wasserstein conditional generative adversarial network with gradient penalty, latent convolutional transformer layers, and a dynamic snake convolutional critic to implicitly compensate for the non-rigid motion and provide 3D coronary artery tree reconstruction. Through simulating projections from coronary computed tomography angiography (CCTA), we achieve the generalisation of 3D coronary tree reconstruction on real non-simultaneous ICA projections. We incorporate an application-specific evaluation metric to validate our proposed model on both a CCTA dataset and a real ICA dataset, together with Chamfer £2 distance. The results demonstrate promising performance of our DeepCA model in vessel topology preservation, recovery of missing features, and generalisation ability to real ICA data. To the best of our knowledge, this is the first study that leverages deep learning to achieve 3D coronary tree reconstruction from two real non-simultaneous x-ray angiographic projections. The implementation of this work is available at: https//github.com/WangStephen/DeepCA.
Yiying Wang, Abhirup Banerjee, Robin Choudhury, Vicente Grau
WACV1
2025 An enhanced underwater fish segmentation method in complex scenes using Swin transformer with cross-scale feature fusion
Shue Liu, Siwei Zhao, Yiying Wang, Jiaming Xin, Dashe Li
Vis. Comput.3
2024 A debiased self-training framework with graph self-supervised pre-training aided for semi-supervised rumor detection
Yuhan Qiao, Chaoqun Cui, Yiying Wang, Caiyan Jia
Neurocomputing3
2022 A denoising method of mine microseismic signal based on NAEEMD and frequency-constrained SVD
Chongchong Zhang, Yannan Shi, Jiangong Liu, Shuaishuai Jiang, Hanqiu Wang, Yiying Wang
J. Supercomput.6