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

Xiaofeng Liu 0009

dblp:95/6332-9 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0002-8185-1477ORCID · verified

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

Computer networks · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Applied, 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.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
generative recommendation
1.012026
From Modularity to Unity: Towards Industrial-Scale Generative Recommendation · WWW 2026
Recommender systems
industrial recommendation
1.012026
From Modularity to Unity: Towards Industrial-Scale Generative Recommendation · WWW 2026
YearPublicationVenuePosition
2026 From Modularity to Unity: Towards Industrial-Scale Generative Recommendation
Xiaofeng Liu 0009, Guanliang Song, Zhen Chen 0021, Dongyue Wang, Xiwei Zhao, Sulong Xu
WWW1
2024 Sparse Federated Learning With Hierarchical Personalization Models
abstract
Federated learning (FL) can achieve privacy-safe and reliable collaborative training without collecting users’ private data. Its excellent privacy security potential promotes a wide range of federated learning (FL) applications in Internet of Things (IoT), wireless networks, mobile devices, autonomous vehicles, and cloud medical treatment. However, the FL method suffers from poor model performance on non-independent and identically distributed (non-i.i.d.) data and excessive traffic volume. To this end, we propose a personalized FL algorithm using a hierarchical proximal mapping based on the moreau envelop, named sparse federated learning with hierarchical personalized models (sFedHP), which significantly improves the acrlong GM performance facing diverse data. A continuously differentiable approximated$\ell _{1}$-norm is also used as the sparse constraint to reduce the communication cost. Convergence analysis shows that sFedHP’s convergence rate is state-of-the-art with linear speedup and the sparse constraint only reduces the convergence rate to a small extent while significantly reducing the communication cost. Experimentally, we demonstrate the benefits of sFedHP compared with the federated averaging (FedAvg), hierarchical fedavg (HierFAVG), and personalized FL methods based on local customization, including FedAMP, FedProx, per- FedAvg, pFedMe, and pFedGP.
Xiaofeng Liu 0009, Qing Wang 0015, Yunfeng Shao 0001, Yinchuan Li
IEEE Internet Things J.1
2024 Breaking the Performance Gap of Fully and Semisupervised Learning in Electromagnetic Signature Recognition
abstract
Intelligent electromagnetic signature recognition is one of the key technologies in Internet of Things (IoT) device connection, which can improve system security and speed up the authentication process. In practical scenarios, as the number of IoT devices increases, electromagnetic features, such as fingerprint and modulation signals also increase substantially. However, since intelligent recognition technology, such as automatic modulation classification (AMC), requires a large amount of labeled data to train the neural network classifier, it is challenging to collect so much labeled data. To address the performance degradation challenges with small training data, we propose an efficient semisupervised electromagnetic recognition framework to break the performance gap with the fully supervised learning scheme. This framework can fully use the unlabeled electromagnetic data collected during the authentication process for self-training to improve the classifier’s performance. According to the idea of consistency regularization, we design a signal augmentation method and propose an ensemble pseudolabel design algorithm to improve confidence. Moreover, we perform a convex combination of electromagnetic features to smooth the model decision boundary while generalizing to unknown data distribution regions. Experimental results on the modulated data demonstrate the performance superiority of the proposed algorithm, i.e., use less than 5% of data with no more than 10% performance drop.
Haozhi Wang, Qing Wang 0015, Luyong Chen, Guanyang Fu, Xiaofeng Liu 0009, Zhicheng Dong 0003, Erdal Panayirci
IEEE Internet Things J.5
2024 Sparse Personalized Federated Learning
abstract
Federated learning (FL) is a collaborative machine learning technique to train a global model (GM) without obtaining clients' private data. The main challenges in FL are statistical diversity among clients, limited computing capability among clients' equipment, and the excessive communication overhead between the server and clients. To address these challenges, we propose a novel sparse personalized FL scheme via maximizing correlation (FedMac). By incorporating an approximated $\ell _{1}$ -norm and the correlation between client models and GM into standard FL loss function, the performance on statistical diversity data is improved and the communicational and computational loads required in the network are reduced compared with nonsparse FL. Convergence analysis shows that the sparse constraints in FedMac do not affect the convergence rate of the GM, and theoretical results show that FedMac can achieve good sparse personalization, which is better than the personalized methods based on the $\ell _{2}$ -norm. Experimentally, we demonstrate the benefits of this sparse personalization architecture compared with the state-of-the-art personalization methods (e.g., FedMac, respectively, achieves 98.95%, 99.37%, 90.90%, 89.06%, and 73.52% accuracy on the MNIST, FMNIST, CIFAR-100, Synthetic, and CINIC-10 datasets under non-independent and identically distributed (i.i.d.) variants).
Xiaofeng Liu 0009, Yinchuan Li, Qing Wang 0015, Xu Zhang 0011, Yunfeng Shao 0001, Yanhui Geng
IEEE Trans. Neural Networks Learn. Syst.1
2020 Adversarial unsupervised domain adaptation for cross scenario waveform recognition
Qing Wang 0015, Panfei Du, Xiaofeng Liu 0009, Jing-Yu Yang 0002, Guohua Wang 0002
Signal Process.3