Feiyue Chen

dblp:310/6190 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0009-0007-2290-1247ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper
Transfer learning and domain adaptation · 44% Representation and self-supervised learning · 44% Information extraction and text analysis · 13%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Network and information security
1 paper
Privacy and data protection · 50% Security and privacy of machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
1.012026
TermGPT: Multi-Level Contrastive Fine-Tuning for Terminology Adaptation in Legal and Financial Domains · AAAI 2026
Machine learning › Transfer learning and domain adaptation
domain adaptation
1.012026
TermGPT: Multi-Level Contrastive Fine-Tuning for Terminology Adaptation in Legal and Financial Domains · AAAI 2026
Recommender systems › trustworthy recommendation
privacy-preserving recommendation
1.012026
FeedGuard: Online Critic-Guided Reinforcement Learning with Privacy-Preserving Feedback for Recommendation · WWW 2026
Recommender systems
reinforcement-learning-based recommendation
1.012026
FeedGuard: Online Critic-Guided Reinforcement Learning with Privacy-Preserving Feedback for Recommendation · WWW 2026
Privacy and data protection
differential privacy
0.312026
FeedGuard: Online Critic-Guided Reinforcement Learning with Privacy-Preserving Feedback for Recommendation · WWW 2026
Security and privacy of machine learning
federated learning
0.312026
FeedGuard: Online Critic-Guided Reinforcement Learning with Privacy-Preserving Feedback for Recommendation · WWW 2026

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

split federated learning · 2.0reinforcement learning · 2.0differential privacy · 2.0critic-guided learning · 2.0sentence graph · 1.0large language model fine-tuning · 1.0contrastive learning · 1.0
YearPublicationVenuePosition
2026 TermGPT: Multi-Level Contrastive Fine-Tuning for Terminology Adaptation in Legal and Financial Domains
abstract
Large language models (LLMs) have demonstrated impressive performance in text generation tasks; however, their embedding spaces often suffer from the isotropy problem, resulting in poor discrimination of domain-specific terminology, particularly in legal and financial contexts. This weakness in term-level representation can severely hinder downstream tasks such as legal judgment prediction or financial risk analysis, where subtle semantic distinctions are critical. To address this problem, we propose TermGPT, a multi-level contrastive fine-tuning framework designed for terminology adaptation. We first construct a sentence graph to capture semantic and structural relations, and generate semantically consistent yet discriminative positive and negative samples based on contextual and topological cues. We then devise a multi-level contrastive learning approach at both the sentence and token levels, enhancing global contextual understanding and fine-grained term discrimination. To support robust evaluation, we construct the first financial terminology dataset derived from official regulatory documents. Experiments show that TermGPT outperforms existing baselines in term discrimination tasks within the finance and legal domains.
Mengying Zhu, Feiyue Chen, Xiaolei Dan, Mengyuan Yang 0002, Shenglin Ben
AAAI3
2026 FeedGuard: Online Critic-Guided Reinforcement Learning with Privacy-Preserving Feedback for Recommendation
abstract
Reinforcement learning-based recommendation systems (RLRS) are increasingly favored for their ability to leverage online interactive feedback, enabling adaptive and personalized decision-making. In this setting, user feedback serves as both a behavioral signal and an optimization target, making it essential for policy learning. However, collecting such feedback, e.g., clicks, ratings, and engagement traces, raises serious privacy concerns, posing critical challenges for value estimation, online adaptation, and privacy protection. In this paper, we propose FeedGuard, a critic-guided reinforcement learning framework with privacy-preserving feedback. FeedGuard enhances trajectory modeling via critic guidance, enables joint online fine-tuning with effective exploration–exploitation tradeoffs, and enforces end-to-end privacy protection across the feedback lifecycle via split federated learning and differential privacy. We further provide a formal analysis of its differential privacy guarantees. Extensive experiments on four public recommendation datasets and the VirtualTB platform show that FeedGuard performs well in both offline and online settings, while maintaining rigorous privacy guarantees with minimal degradation.
Mengying Zhu, Feiyue Chen, Lifan Jiang, Mengyuan Yang 0002, Guanjie Cheng
WWW2
2022 Secure Constructive Interference Precoding for Downlink MIMO Relay System
abstract
Constructive Interference (CI) has shown great advantages in improving security and reliability of communication systems, which utilizes channel state information (CSI) and knowledge of the instantaneous information data on symbol level. In this paper, we explore the CI-based secure precoding problem under a dual-hop and half-duplex downlink transmission relay system in the presence of an eavesdropper. We propose to jointly optimize the precoding strategy at the source and at the relay through an alternating optimization process. To alleviate the high computational costs and circumvent the difficulty of practical implementation, we propose a low-complexity iterative algorithm for the optimization, where we use Karush-Kuhn-Tucker (KKT) conditions to analyze and simplify the previous optimization problem at the relay. Numerical results show that the proposed algorithm can achieve an improved performance compared with traditional zero-forcing/regularized zero-forcing (ZF/RZF) methods and significantly degrade the eavesdropper’s performance.
Feiyue Chen, Ye Fan 0006, Rugui Yao, Ang Li 0003
WCNC1
2022 Subspace alignment based on an extreme learning machine for electronic nose drift compensation
Jia Yan 0002, Feiyue Chen, Tao Liu 0014, Yuelin Zhang, Danhong Yi, Shukai Duan 0001
Knowl. Based Syst.2