Zhenyu Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhenyu Xu has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Changjun Zhou
Zhejiang Normal University
3 shared publications - Donglin Zhu
School of Computer Science and Technology, Zhejiang Normal University, Jinhua 321004, China
3 shared publications - Yehong Li
School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, China
3 shared publications - Chengtian Ouyang
School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, China
2 shared publications - Jihong Mao
School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, China
2 shared publications - Huijuan Lu
Main Campus, China Jiliang University, Hangzhou 310018, China
1 shared publication
Latest Publications
- Open Access
- 19 December 2025
- Published by MDPI AG in Electronics
- Vol. 15 (1) , 9
Enhanced Tensor Incomplete Multi-View Clustering with Dual Adaptive Weight
In practical application, the gathered multi-view data typically misses samples, known as incomplete multi-view data. Most existing incomplete multi-view clustering methods obtain consensus information in multi-view data by completing incomplete data using zero, mean values, etc. These approaches often ignore the higher-order relationship and structural information between different views. To alleviate the above problems, we propose enhanced tensor incomplete multi-view clustering with dual adaptive weight (ETIMC), which can acquire the higher-order relationship, and structural information between multiple perspectives, adaptively recover the missing samples and distinguish the contribution degree of different views. Specifically, the embedded representations obtained from incomplete multi-view data are stacked into a third-order tensor to capture the higher-order relationship. Then, a consensus matrix can be drawn from these potential representations via a self-weighting mechanism. Additionally, we adaptively reconstruct the missing samples while capturing structural information by the hypergraph Laplacian item. Moreover, we integrate the embedded representation of each view, tensor constraints, hypergraph Laplacian regularization, and dual adaptive weighted mechanisms into a unified framework. Experimental results on natural and synthetic incomplete datasets show the superiority of ETIMC.
- 19 December 2025
- Published by MDPI AG in Electronics
- Vol. 15 (1) , 9
Open AccessEnhanced Tensor Incomplete Multi-View Clustering with Dual Adaptive Weight
In practical application, the gathered multi-view data typically misses samples, known as incomplete multi-view data. Most existing incomplete multi-view clustering methods obtain consensus information in multi-view data by completing incomplete data using zero, mean values, etc. These approaches often ignore the higher-order relationship and structural information between different views. To alleviate the above problems, we propose enhanced tensor incomplete multi-view clustering with dual adaptive weight (ETIMC), which can acquire the higher-order relationship, and structural information between multiple perspectives, adaptively recover the missing samples and distinguish the contribution degree of different views. Specifically, the embedded representations obtained from incomplete multi-view data are stacked into a third-order tensor to capture the higher-order relationship. Then, a consensus matrix can be drawn from these potential representations via a self-weighting mechanism. Additionally, we adaptively reconstruct the missing samples while capturing structural information by the hypergraph Laplacian item. Moreover, we integrate the embedded representation of each view, tensor constraints, hypergraph Laplacian regularization, and dual adaptive weighted mechanisms into a unified framework. Experimental results on natural and synthetic incomplete datasets show the superiority of ETIMC.
- Open Access
- 17 March 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (3) , 185
FedDyH: A Multi-Policy with GA Optimization Framework for Dynamic Heterogeneous Federated Learning
Federated learning (FL) is a distributed learning technique that ensures data privacy and has shown significant potential in cross-institutional image analysis. However, existing methods struggle with the inherent dynamic heterogeneity of real-world data, such as changes in cellular differentiation during disease progression or feature distribution shifts due to different imaging devices. This dynamic heterogeneity can cause catastrophic forgetting, leading to reduced performance in medical predictions across stages. Unlike previous federated learning studies that paid insufficient attention to dynamic heterogeneity, this paper proposes the FedDyH framework to address this challenge. Inspired by the adaptive regulation mechanisms of biological systems, this framework incorporates several core modules to tackle the issues arising from dynamic heterogeneity. First, the framework simulates intercellular information transfer through cross-client knowledge distillation, preserving local features while mitigating knowledge forgetting. Additionally, a dynamic regularization term is designed in which the strength can be adaptively adjusted based on real-world conditions. This mechanism resembles the role of regulatory T cells in the immune system, balancing global model convergence with local specificity adjustments to enhance the robustness of the global model while preventing interference from diverse client features. Finally, the framework introduces a genetic algorithm (GA) to simulate biological evolution, leveraging mechanisms such as gene selection, crossover, and mutation to optimize hyperparameter configurations. This enables the model to adaptively find the optimal hyperparameters in an ever-changing environment, thereby improving both adaptability and performance. Prior to this work, few studies have explored the use of optimization algorithms for hyperparameter tuning in federated learning. Experimental results demonstrate that the FedDyH framework improves accuracy compared to the SOTA baseline FedDecorr by 2.59%, 0.55%, and 5.79% on the MNIST, Fashion-MNIST, and CIFAR-10 benchmark datasets, respectively. This framework effectively addresses data heterogeneity issues in dynamic heterogeneous environments, providing an innovative solution for achieving more stable and accurate distributed federated learning.
- 17 March 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (3) , 185
Open AccessFedDyH: A Multi-Policy with GA Optimization Framework for Dynamic Heterogeneous Federated Learning
Federated learning (FL) is a distributed learning technique that ensures data privacy and has shown significant potential in cross-institutional image analysis. However, existing methods struggle with the inherent dynamic heterogeneity of real-world data, such as changes in cellular differentiation during disease progression or feature distribution shifts due to different imaging devices. This dynamic heterogeneity can cause catastrophic forgetting, leading to reduced performance in medical predictions across stages. Unlike previous federated learning studies that paid insufficient attention to dynamic heterogeneity, this paper proposes the FedDyH framework to address this challenge. Inspired by the adaptive regulation mechanisms of biological systems, this framework incorporates several core modules to tackle the issues arising from dynamic heterogeneity. First, the framework simulates intercellular information transfer through cross-client knowledge distillation, preserving local features while mitigating knowledge forgetting. Additionally, a dynamic regularization term is designed in which the strength can be adaptively adjusted based on real-world conditions. This mechanism resembles the role of regulatory T cells in the immune system, balancing global model convergence with local specificity adjustments to enhance the robustness of the global model while preventing interference from diverse client features. Finally, the framework introduces a genetic algorithm (GA) to simulate biological evolution, leveraging mechanisms such as gene selection, crossover, and mutation to optimize hyperparameter configurations. This enables the model to adaptively find the optimal hyperparameters in an ever-changing environment, thereby improving both adaptability and performance. Prior to this work, few studies have explored the use of optimization algorithms for hyperparameter tuning in federated learning. Experimental results demonstrate that the FedDyH framework improves accuracy compared to the SOTA baseline FedDecorr by 2.59%, 0.55%, and 5.79% on the MNIST, Fashion-MNIST, and CIFAR-10 benchmark datasets, respectively. This framework effectively addresses data heterogeneity issues in dynamic heterogeneous environments, providing an innovative solution for achieving more stable and accurate distributed federated learning.
- Open Access
- 17 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (2) , 366
Federated Learning for Extreme Label Noise: Enhanced Knowledge Distillation and Particle Swarm Optimization
Federated learning, with its unique privacy protection mechanisms and distributed model training capabilities, provides an effective solution for data security by addressing the challenges associated with the inability to directly share private data due to privacy concerns. It exhibits broad application potential across various fields, particularly in scenarios such as autonomous vehicular networks, where collaborative learning is required from data sources distributed across different clients, thus optimizing and enhancing model performance. Nevertheless, in complex real-world environments, challenges such as data poisoning and labeling errors may cause some clients to introduce label noise that significantly exceeds ordinary levels, severely impacting model performance. The following conclusions are drawn from research on extreme label noise: highly polluted data severely affect the generalization capability of the global model and the stability of the training process, while the reweighting strategy can improve model performance. Based on these research conclusions, we propose a method named Enhanced Knowledge Distillation and Particle Swarm Optimization for Federated Learning (FedDPSO) to deal with extreme label noise. In FedDPSO, the server dynamically identifies extremely noisy clients based on uncertainty. It then uses the particle swarm optimization algorithm to determine client model weights for global model aggregation. In subsequent rounds, the identified extremely noisy clients construct an interpolation loss combining pseudo-label loss and knowledge distillation loss, effectively mitigating the negative impact of label noise overfitting on the local model. We carried out experiments on the CIFAR10/100 datasets to validate the effectiveness of FedDPSO. At the highest noise ratio under Beta = (0.1, 0.1), experiments show that FedDPSO improves the average accuracy on CIFAR10 by 15% compared to FedAvg and by 11% compared to the more powerful FOCUS. On CIFAR100, it outperforms FedAvg by 8% and FOCUS by 5%.
- 17 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (2) , 366
Open AccessFederated Learning for Extreme Label Noise: Enhanced Knowledge Distillation and Particle Swarm Optimization
Federated learning, with its unique privacy protection mechanisms and distributed model training capabilities, provides an effective solution for data security by addressing the challenges associated with the inability to directly share private data due to privacy concerns. It exhibits broad application potential across various fields, particularly in scenarios such as autonomous vehicular networks, where collaborative learning is required from data sources distributed across different clients, thus optimizing and enhancing model performance. Nevertheless, in complex real-world environments, challenges such as data poisoning and labeling errors may cause some clients to introduce label noise that significantly exceeds ordinary levels, severely impacting model performance. The following conclusions are drawn from research on extreme label noise: highly polluted data severely affect the generalization capability of the global model and the stability of the training process, while the reweighting strategy can improve model performance. Based on these research conclusions, we propose a method named Enhanced Knowledge Distillation and Particle Swarm Optimization for Federated Learning (FedDPSO) to deal with extreme label noise. In FedDPSO, the server dynamically identifies extremely noisy clients based on uncertainty. It then uses the particle swarm optimization algorithm to determine client model weights for global model aggregation. In subsequent rounds, the identified extremely noisy clients construct an interpolation loss combining pseudo-label loss and knowledge distillation loss, effectively mitigating the negative impact of label noise overfitting on the local model. We carried out experiments on the CIFAR10/100 datasets to validate the effectiveness of FedDPSO. At the highest noise ratio under Beta = (0.1, 0.1), experiments show that FedDPSO improves the average accuracy on CIFAR10 by 15% compared to FedAvg and by 11% compared to the more powerful FOCUS. On CIFAR100, it outperforms FedAvg by 8% and FOCUS by 5%.
- Open Access
- 28 October 2024
- Published by Springer Nature in Discover Computing
- Vol. 27 (1) , 1-18
Enhancing federated learning with dynamic weight adjustment based on particle swarm optimization
- 28 October 2024
- Published by Springer Nature in Discover Computing
- Vol. 27 (1) , 1-18
Open AccessEnhancing federated learning with dynamic weight adjustment based on particle swarm optimization