Fei Zheng

Dr. Fei Zheng

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
2 March 2024 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
Chaochao ChenChaochao Chen
Chaochao Chen
FZFei Zheng
Fei Zheng
JCJamie Cui
Jamie Cui
YCYuwei Cao
Yuwei Cao
Guanfeng LiuGuanfeng Liu
Guanfeng Liu
JZJun Zhou
Jun Zhou

23 March 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
FZFei Zheng
Fei Zheng
Chaochao ChenChaochao Chen
Chaochao Chen
XZXiaolin Zheng
Xiaolin Zheng
MZMingjie Zhu
Mingjie Zhu

18 December 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZBZe Bian
Ze Bian
SLShi-Jian Luo
Shi-Jian Luo
FZFei Zheng
Fei Zheng
LWLiuyu Wang
Liuyu Wang
PSPing Shan
Ping Shan
Bionic reasoning is a significant process in product biologically inspired design (BID), in which designers search for creatures and products that are matched for design. Several studies have tried to assist designers in bionic reasoning, but there are still limits. Designers’ bionic reasoning thinking in product BID is vague, and there is a lack of fuzzy semantic search methods at the sentence level. This study tries to assist designers’ bionic semantic reasoning in product BID. First, experiments were conducted to determine the designer’s bionic reasoning thinking in top-down and bottom-up processes. Bionic mapping relationships, including affective perception, form, function, material, and environment, were obtained. Second, the bidirectional encoder representations from transformers (BERT) pretraining model was used to calculate the semantic similarity of product description sentences and biological sentences so that designers could choose the high-ranked results to finish bionic reasoning. Finally, we used a product BID example to show the bionic semantic reasoning process and verify the feasibility of the method.

24 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
FZFei Zheng
Fei Zheng
Recently, large language models (LLMs) have drawn extensive attention from academia and the public, due to the advent of the ChatGPT. While LLMs show their astonishing ability in text generation for various tasks, privacy concerns limit their usage in real-life businesses. More specifically, either the user's inputs (the user sends the query to the model-hosting server) or the model (the user downloads the complete model) itself will be revealed during the usage. Vertical federated learning (VFL) is a promising solution to this kind of problem. It protects both the user's input and the knowledge of the model by splitting the model into a bottom part and a top part, which is maintained by the user and the model provider, respectively. However, in this paper, we demonstrate that in LLMs, VFL fails to protect the user input since it is simple and cheap to reconstruct the input from the intermediate embeddings. Experiments show that even with a commercial GPU, the input sentence can be reconstructed in only one second. We also discuss several possible solutions to enhance the privacy of vertical federated LLMs.

15 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
Chaochao ChenChaochao Chen
Chaochao Chen
JQJiaming Qian
Jiaming Qian
FZFei Zheng
Fei Zheng
YLYachuan Liu
Yachuan Liu
The prevalence of recommendation systems also brings privacy concerns to both the users and the sellers, as centralized platforms collect as much data as possible from them. To keep the data private, we propose PADER: a Paillier-based secure decentralized social recommendation system. In this system, the users and the sellers are nodes in a decentralized network. The training and inference of the recommendation model are carried out securely in a decentralized manner, without the involvement of a centralized platform. To this end, we apply the Paillier cryptosystem to the SoReg (Social Regularization) model, which exploits both user's ratings and social relations. We view the SoReg model as a two-party secure polynomial evaluation problem and observe that the simple bipartite computation may result in poor efficiency. To improve efficiency, we design secure addition and multiplication protocols to support secure computation on any arithmetic circuit, along with an optimal data packing scheme that is suitable for the polynomial computations of real values. Experiment results show that our method only takes about one second to iterate through one user with hundreds of ratings, and training with ~500K ratings for one epoch only takes <3 hours, which shows that the method is practical in real applications. The code is available at https://github.com/GarminQ/PADER.