Zhe Xue

Zhe Xue

Auto-generated profile, based on publicly available information

Zhe Xue

Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2019 in Information Sciences
Verified
Journal Article
Closed access
ZXZhe Xue
Zhe Xue
JDJunping Du
Junping Du
DDDawei Du
Dawei Du
SLSiwei Lyu
Siwei Lyu

7 May 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
JZJin'gang Zhang
Jin'gang Zhang
Wenqi RenWenqi Ren
Wenqi Ren
SZShengdong Zhang
Shengdong Zhang
HZHe Zhang
He Zhang
YNYunfeng Nie
Yunfeng Nie
XCXiaochun Cao
Xiaochun Cao
The commonly used atmospheric model in image dehazing cannot hold in real cases. Although deep end-to-end networks were presented to solve this problem by disregarding the physical model, the transmission map in the atmospheric model contains significant haze density information, which cannot simply be ignored. In this article, we propose a novel hierarchical density-aware dehazing network, which consists of a the densely connected pyramid encoder, a density generator, and a Laplacian pyramid decoder. The proposed network incorporates density estimation but alleviates the constraint of the atmospheric model. The predicted haze density then guides the Laplacian pyramid decoder to generate a haze-free image in a coarse-to-fine fashion. In addition, we introduce a multiscale discriminator to preserve global and local consistency for dehazing. We conduct extensive experiments on natural and synthetic hazy images, which prove that the proposed model performs favorably against the state-of-the-art dehazing approaches.

1 August 2019
Verified
Conference Paper
Open access
ZXZhe Xue
Zhe Xue
JDJunping Du
Junping Du
DDDawei Du
Dawei Du
Wenqi RenWenqi Ren
Wenqi Ren
SLSiwei Lyu
Siwei Lyu
Incomplete view information often results in failure cases of the conventional multi-view methods. To address this problem, we propose a Deep Correlated Predictive Subspace Learning (DCPSL) method for incomplete multi-view semi-supervised classification. Specifically, we integrate semi-supervised deep matrix factorization, correlated subspace learning, and multi-view label prediction into a unified framework to jointly learn the deep correlated predictive subspace and multi-view shared and private label predictors. DCPSL is able to learn proper subspace representation that is suitable for class label prediction, which can further improve the performance of classification. Extensive experimental results on various practical datasets demonstrate that the proposed method performs favorably against the state-of-the-art methods.

9 February 2022 in International Journal of Intelligent Systems
Verified
Journal Article
Closed access
PDF file
MXMingying Xu
Mingying Xu
JDJunping Du
Junping Du
ZXZhe Xue
Zhe Xue
ZGZeli Guan
Zeli Guan
FKFeifei Kou
Feifei Kou
LSLei Shi
Lei Shi

24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
YZYu Zang
Yu Zang
ZXZhe Xue
Zhe Xue
SOShilong Ou
Shilong Ou
LCLingyang Chu
Lingyang Chu
JDJunping Du
Junping Du
YLYunfei Long
Yunfei Long
Asynchronous federated learning (AFL) is a distributed machine learning technique that allows multiple devices to collaboratively train deep learning models without sharing local data. However, AFL suffers from low efficiency due to poor client model training quality and slow server model convergence speed, which are a result of the heterogeneous nature of both data and devices. To address these issues, we propose Efficient Asynchronous Federated Learning with Prospective Momentum Aggregation and Fine-Grained Correction (FedAC). Our framework consists of three key components. The first component is client weight evaluation based on temporal gradient, which evaluates the client weight based on the similarity between the client and server update directions. The second component is adaptive server update with prospective weighted momentum, which uses an asynchronous buffered update strategy and a prospective weighted momentum with adaptive learning rate to update the global model in server. The last component is client update with fine-grained gradient correction, which introduces a fine-grained gradient correction term to mitigate the client drift and correct the client stochastic gradient. We conduct experiments on real and synthetic datasets, and compare with existing federated learning methods. Experimental results demonstrate effective improvements in model training efficiency and AFL performance by our framework.

2 August 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZGZeli Guan
Zeli Guan
YLYawen Li
Yawen Li
ZPZhenhui Pan
Zhenhui Pan
YLYuxin Liu
Yuxin Liu
ZXZhe Xue
Zhe Xue
During the training process of federated learning models, the domain information of the target test data on the server can differ greatly from the training data of each client, leading to a decrease in the performance of the federated model. Additionally, due to privacy protection during federated training, clients cannot see the target domain test data, and the distribution information of the target data cannot be used. This poses a new challenge for federated learning. Domain generalization techniques are often used in centralized frameworks to resolve such problems. In recent years, the domain generalization method based on feature decorrelation has enabled models to learn knowledge with a stronger generalization ability in unseen target domain data. However, existing methods require data centralization in the feature decorrelation process, which conflicts with data privacy protection in federated learning. To address these issues, we propose Reinforcement Federated Domain Generalization (RFDG), which incorporates domain generalization in federated learning via reinforcement learning. RFDG can improve the generalization ability of the federated model of unseen target domain test data. We design a reinforcement federated feature decorrelation policy that uses reinforcement learning technology to transform the sample reweight work into a parameterized sample reweight policy that can be shared among federated learning clients. We develop reinforcement federated experience replay techniques to supplement the feature information loss of local data due to the mini-batch mechanism during the policy learning process. When the policy is shared by each client, those features can be decorrelated from a global perspective, allowing the model to focus on capturing the fundamental association between features and labels to learn domain-invariant knowledge. We verified the effectiveness of our method through extensive experiments using four publicly available datasets.