Yu Feng 0015

dblp:30/4550-15 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0004-2887-9317ORCID · verified

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

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

Artificial intelligence
3 papers
Efficient and distributed learning · 46% Learning paradigms · 40% Language models and text generation · 7%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 67% Knowledge graphs · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.912025
PM-MOE: Mixture of Experts on Private Model Parameters for Personalized Federated Learning · WWW 2025
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
0.912025
PM-MOE: Mixture of Experts on Private Model Parameters for Personalized Federated Learning · WWW 2025
Information retrieval › retrieval-augmented generation
graph-based retrieval-augmented generation
0.912025
HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation · NeurIPS 2025
Knowledge graphs
knowledge graph construction
0.912025
HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation · NeurIPS 2025
Information retrieval
retrieval-augmented generation
0.912025
HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation · NeurIPS 2025
Machine learning › Learning paradigms
continual learning
0.812024
CP-Prompt: Composition-Based Cross-modal Prompting for Domain-Incremental Continual Learning · ACM Multimedia 2024
Machine learning › Learning paradigms › continual learning
domain-incremental learning
0.812024
CP-Prompt: Composition-Based Cross-modal Prompting for Domain-Incremental Continual Learning · ACM Multimedia 2024
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.312025
HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation · NeurIPS 2025
Computer vision › Vision and language › multimodal prompt learning
cross-modal prompting
0.212024
CP-Prompt: Composition-Based Cross-modal Prompting for Domain-Incremental Continual Learning · ACM Multimedia 2024

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

retrieval-augmented generation · 1.7hypergraph · 1.7personalized module selection · 0.9mixture of experts · 0.9energy-based denoising · 0.9prompt tuning · 0.8composition-based prompting · 0.8
YearPublicationVenuePosition
2025 HyperGraphRAG: Retrieval-Augmented Generation via Hypergraph-Structured Knowledge Representation
abstract
Standard Retrieval-Augmented Generation (RAG) relies on chunk-based retrieval, whereas GraphRAG advances this approach by graph-based knowledge representation. However, existing graph-based RAG approaches are constrained by binary relations, as each edge in an ordinary graph connects only two entities, limiting their ability to represent the n-ary relations (n >= 2) in real-world knowledge. In this work, we propose HyperGraphRAG, the first hypergraph-based RAG method that represents n-ary relational facts via hyperedges. HyperGraphRAG consists of a comprehensive pipeline, including knowledge hypergraph construction, retrieval, and generation. Experiments across medicine, agriculture, computer science, and law demonstrate that HyperGraphRAG outperforms both standard RAG and previous graph-based RAG methods in answer accuracy, retrieval efficiency, and generation quality.
Haoran Luo 0001, Haihong E, Guanting Chen 0004, Yandan Zheng, Xiaobao Wu, Yikai Guo, Qika Lin, Yu Feng 0015, Zemin Kuang, Meina Song, Yifan Zhu 0001, Anh Tuan Luu
NeurIPS8
2025 PM-MOE: Mixture of Experts on Private Model Parameters for Personalized Federated Learning
abstract
Federated learning (FL) has gained widespread attention for its privacy-preserving and collaborative learning capabilities. Due to significant statistical heterogeneity, traditional FL struggles to generalize a shared model across diverse data domains. Personalized federated learning addresses this issue by dividing the model into a globally shared part and a locally private part, with the local model correcting representation biases introduced by the global model. Nevertheless, locally converged parameters more accurately capture domain-specific knowledge, and current methods overlook the potential benefits of these parameters. To address these limitations, we propose PM-MoE architecture. This architecture integrates a mixture of personalized modules and an energy-based personalized modules denoising, enabling each client to select beneficial personalized parameters from other clients. We applied the PM-MoE architecture to nine recent model-split-based personalized federated learning algorithms, achieving performance improvements with minimal additional training. Extensive experiments on six widely adopted datasets and two heterogeneity settings validate the effectiveness of our approach. The source code is available at https://github.com/dannis97500/PM-MOE.
Yu Feng 0015, Yifan Zhu 0001, Zongfu Han, Xie Yu, Kaiwen Xue 0001, Haoran Luo 0001, Mengyang Sun, Guangwei Zhang 0003, Meina Song
WWW1
2024 CP-Prompt: Composition-Based Cross-modal Prompting for Domain-Incremental Continual Learning
Yu Feng 0015, Yifan Zhu 0001, Zongfu Han, Haoran Luo 0001, Guangwei Zhang 0003, Meina Song
ACM Multimedia1