EDBT 2026 Demo / reviewers in the wild / expert
Yiqun Chen 0004
dblp:59/1143-4
· DBLP profile ↗
10ranked-venue papers
5as first author
10since 2021 · last 2025
0009-0008-6135-2604ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 3 first-author · 7 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 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
4 papers |
Reinforcement learning · 42% Language models and text generation · 14% Multi-agent systems · 14% | |
| Databases, data mining, and information retrieval
3 papers |
Information retrieval · 83% Recommender systems · 17% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
2.5 | 3 | 2025 | MA4DIV: Multi-Agent Reinforcement Learning for Search Result Diversification · WWW 2025 Improving Retrieval-Augmented Generation through Multi-Agent Reinforcement Learning · NeurIPS 2025 PTDE: Personalized Training with Distilled Execution for Multi-Agent Reinforcement Learning · IJCAI 2024 |
Knowledge, reasoning and agents › Multi-agent systems › multi-agent collaboration
cooperative task |
0.9 | 1 | 2025 | MA4DIV: Multi-Agent Reinforcement Learning for Search Result Diversification · WWW 2025 |
Natural language and speech › Language models and text generation
retrieval-augmented generation |
0.9 | 1 | 2025 | Improving Retrieval-Augmented Generation through Multi-Agent Reinforcement Learning · NeurIPS 2025 |
Information retrieval › ranking › text ranking
document ranking |
0.9 | 1 | 2025 | TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy · WWW 2025 |
Information retrieval › ranking › learning to rank
ensemble ranking |
0.9 | 1 | 2025 | TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy · WWW 2025 |
Information retrieval › retrieval models › neural retrieval › neural ranking model
LLM-based ranking |
0.9 | 1 | 2025 | TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy · WWW 2025 |
Recommender systems
multimodal recommendation |
0.9 | 1 | 2025 | FITMM: Adaptive Frequency-Aware Multimodal Recommendation via Information-Theoretic Representation Learning · ACM Multimedia 2025 |
Information retrieval
ranking |
0.9 | 1 | 2025 | TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy · WWW 2025 |
Information retrieval
search result diversification |
0.9 | 1 | 2025 | MA4DIV: Multi-Agent Reinforcement Learning for Search Result Diversification · WWW 2025 |
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
0.8 | 1 | 2024 | PTDE: Personalized Training with Distilled Execution for Multi-Agent Reinforcement Learning · IJCAI 2024 |
Machine learning › Transfer learning and domain adaptation › model adaptation
personalized training |
0.8 | 1 | 2024 | PTDE: Personalized Training with Distilled Execution for Multi-Agent Reinforcement Learning · IJCAI 2024 |
Machine learning › Graph learning
graph neural network |
0.3 | 1 | 2025 | FITMM: Adaptive Frequency-Aware Multimodal Recommendation via Information-Theoretic Representation Learning · ACM Multimedia 2025 |
Methods — techniques the papers use, named apart from their topics
multi-agent reinforcement learning · 2.6α-NDCG optimization · 1.7spectral decomposition · 1.7information bottleneck · 1.7contrastive learning · 1.7reinforcement learning · 0.9points system · 0.9multistage grouping · 0.9large language model · 0.9personalized training · 0.8knowledge distillation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CLUE: Using Large Language Models for Judging Document Usefulness in Web Search EvaluationabstractThe widely adopted Cranfield paradigm fails to adequately capture user satisfaction due to a weak relevance-satisfaction correlation. Additionally, constructing test collections incurs high relevance annotation costs. To address these two limitations, we aim to explore the use of large language models (LLMs) to generate multilevel usefulness labels. We propose CLUE, a user-centric evaluation method that explicitly incorporates users' search context and behavior information into LLMs. Inspired by ordinal regression, it employs a cascade structure tailored for multilevel usefulness judgments. Our study shows that using CLUE, LLMs can effectively assess usefulness when provided with search context and behavior, outperforming third-party labeling methods. We also conduct ablation studies to explore the impact of each component in CLUE. Finally, we utilize the usefulness labels generated by CLUE to predict user satisfaction. Real-world experiments reveal that incorporating CLUE's usefulness labels significantly enhances the performance of the satisfaction prediction model. Xingzhu Wang, Erhan Zhang, Yiqun Chen 0004, Jinghan Xuan, Yucheng Hou, Yitong Xu, Ying Nie 0006, Shuaiqiang Wang, Dawei Yin 0001, Jiaxin Mao |
CIKM | 3 |
| 2025 | FITMM: Adaptive Frequency-Aware Multimodal Recommendation via Information-Theoretic Representation LearningabstractMultimodal recommendation aims to enhance user preference modeling by leveraging rich item content such as images and text. Yet dominant systems fuse modalities in the spatial domain, obscuring the frequency structure of signals and amplifying misalignment and redundancy. We adopt a spectral information-theoretic view and show that, under an orthogonal transform that approximately block-diagonalizes bandwise covariances, the Gaussian Information Bottleneck objective decouples across frequency bands, providing a principled basis for separate-then-fuse paradigm. Building on this foundation, we propose FITMM, a Frequency-aware Information-Theoretic framework for multimodal recommendation. FITMM constructs graph-enhanced item representations, performs modality-wise spectral decomposition to obtain orthogonal bands, and forms lightweight within-band multimodal components. A residual, task-adaptive gate aggregates bands into the final representation. To control redundancy and improve generalization, we regularize training with a frequency-domain IB term that allocates capacity across bands (Wiener-like shrinkage with shut-off of weak bands). We further introduce a cross-modal spectral consistency loss that aligns modalities within each band. The model is jointly optimized with the standard recommendation loss. Extensive experiments on three real-world datasets demonstrate that FITMM consistently and significantly outperforms advanced baselines. Wei Yang 0034, Rui Zhong 0003, Yiqun Chen 0004, Heng Ping, Chi Lu 0001, Peng Jiang 0002 |
ACM Multimedia | 3 |
| 2025 | Improving Retrieval-Augmented Generation through Multi-Agent Reinforcement LearningabstractRetrieval-augmented generation (RAG) is widely utilized to incorporate external knowledge into large language models, thereby enhancing factuality and reducing hallucinations in question-answering (QA) tasks. A standard RAG pipeline consists of several components, such as query rewriting, document retrieval, document filtering, and answer generation. However, these components are typically optimized separately through supervised fine-tuning, which can lead to misalignments between the objectives of individual components and the overarching aim of generating accurate answers. Although recent efforts have explored using reinforcement learning (RL) to optimize specific RAG components, these approaches often focus on simple pipelines with only two components or do not adequately address the complex interdependencies and collaborative interactions among the modules. To overcome these limitations, we propose treating the complex RAG pipeline with multiple components as a multi-agent cooperative task, in which each component can be regarded as an RL agent. Specifically, we present MMOA-RAG\footnote{The code of MMOA-RAG is on \url{https://github.com/chenyiqun/MMOA-RAG}.}, \textbf{M}ulti-\textbf{M}odule joint \textbf{O}ptimization \textbf{A}lgorithm for \textbf{RAG}, which employs multi-agent reinforcement learning to harmonize all agents' goals toward a unified reward, such as the F1 score of the final answer. Experiments conducted on various QA benchmarks demonstrate that MMOA-RAG effectively boost the overall performance of the pipeline and outperforms existing baselines. Furthermore, comprehensive ablation studies validate the contributions of individual components and demonstrate MMOA-RAG can be adapted to different RAG pipelines and benchmarks. Yiqun Chen 0004, Lingyong Yan, Weiwei Sun 0001, Xinyu Ma 0001, Yi Zhang 0050, Shuaiqiang Wang, Dawei Yin 0001, Yiming Yang 0002, Jiaxin Mao |
NeurIPS | 1 |
| 2025 | Structured Spectral Reasoning for Frequency-Adaptive Multimodal RecommendationabstractMultimodal recommendation aims to integrate collaborative signals with heterogeneous content such as visual and textual information, but remains challenged by modality-specific noise, semantic inconsistency, and unstable propagation over user–item graphs. These issues are often exacerbated by naive fusion or shallow modeling strategies, leading to degraded generalization and poor robustness. While recent work has explored the frequency domain as a lens to separate stable from noisy signals, most methods rely on static filtering or reweighting, lacking the ability to reason over spectral structure or adapt to modality-specific reliability. To address these challenges, we propose a Structured Spectral Reasoning (SSR) framework for frequency-aware multimodal recommendation. Our method follows a four-stage pipeline: (i) Decompose graph-based multimodal signals into spectral bands via graph-guided transformations to isolate semantic granularity; (ii) Modulate band-level reliability with spectral band masking, a training-time masking with representation-consistency objective that suppresses brittle frequency components; (iii) Fuse complementary frequency cues using hyperspectral reasoning with low-rank cross-band interaction; and (iv) Align modality-specific spectral features via contrastive regularization to promote semantic and structural consistency. Experiments on three real-world benchmarks show consistent gains over strong baselines, particularly under sparse and cold-start settings. Additional analyses indicate that structured spectral modeling improves robustness and provides clearer diagnostics of how different bands contribute to performance. Wei Yang 0041, Rui Zhong 0003, Yiqun Chen 0004, Chi Lu 0001, Peng Jiang 0002 |
NeurIPS | 3 |
| 2025 | TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired StrategyabstractLarge Language Models (LLMs) are increasingly employed in zero-shot documents ranking, yielding commendable results. However, several significant challenges still persist in LLMs for ranking: (1) LLMs are constrained by limited input length, precluding them from processing a large number of documents simultaneously; (2) The output document sequence is influenced by the input order of documents, resulting in inconsistent ranking outcomes; (3) Achieving a balance between cost and ranking performance is challenging. To tackle these issues, we introduce a novel documents ranking method called TourRank1. which is inspired by the sport tournaments, such as FIFA World Cup. Specifically, we 1) overcome the limitation in input length and reduce the ranking latency by incorporating a multi-stage grouping strategy similar to the parallel group stage of sport tournaments; 2) improve the ranking performance and robustness to input orders by using a points system to ensemble multiple ranking results. We test TourRank with different LLMs on the TREC DL datasets and the BEIR benchmark. The experimental results demonstrate that TourRank delivers state-of-the-art performance at a modest cost. Yiqun Chen 0004, Qi Liu 0071, Yi Zhang 0050, Weiwei Sun 0001, Xinyu Ma 0001, Wei Yang 0041, Daiting Shi, Jiaxin Mao, Dawei Yin 0001 |
WWW | 1 |
| 2025 | MA4DIV: Multi-Agent Reinforcement Learning for Search Result DiversificationabstractSearch result diversification (SRD), which aims to ensure that documents in a ranking list cover a broad range of subtopics, is a significant and widely studied problem in Information Retrieval and Web Search. Existing methods primarily utilize a paradigm of ''greedy selection'', i.e., selecting one document with the highest diversity score at a time or optimize an approximation of the objective function. These approaches tend to be inefficient and are easily trapped in a suboptimal state. To address these challenges, we introduce Multi-Agent reinforcement learning (MARL) for search result DIVersity, which called MA4DIV. In this approach, each document is an agent and the search result diversification is modeled as a cooperative task among multiple agents. By modeling the SRD ranking problem as a cooperative MARL problem, this approach allows for directly optimizing the diversity metrics, such as α-NDCG, while achieving high training efficiency. We conducted experiments on public TREC datasets and a larger scale dataset in the industrial setting. The experiemnts show that MA4DIV achieves substantial improvements in both effectiveness and efficiency than existing baselines, especially on the industrial dataset. Yiqun Chen 0004, Jiaxin Mao, Yi Zhang 0050, Dehong Ma, Daiting Shi, Zhicong Cheng, Simiu Gu, Dawei Yin 0001 |
WWW | 1 |
| 2024 | PTDE: Personalized Training with Distilled Execution for Multi-Agent Reinforcement Learning
Yiqun Chen 0004, Hangyu Mao, Jiaxin Mao, Shiguang Wu 0001, Bin Zhang 0052, Wei Yang 0041, Hongxing Chang |
IJCAI | 1 |
| 2022 | Multi-Agent Hyper-Attention Policy Optimization
Bin Zhang 0052, Zhiwei Xu 0005, Yiqun Chen 0004, Dapeng Li 0001, Yunpeng Bai, Lijuan Li 0002 |
ICONIP (1) | 3 |
| 2022 | Commander-Soldiers Reinforcement Learning for Cooperative Multi-Agent SystemsabstractIn ball sports, such as basketball, the coach can guide players to better offend and defend from a holistic perspective to win the game. Inspired by such scenarios, we introduce a coach-like concept into the decision-making process of cooperative multi-agent systems. We propose a new framework Commander-Soldiers Reinforcement Learning (CSRL), for Multi-Agent systems. Specifically, we introduce a virtual role, Commander, which can obtain and encode global information every T steps and send the encoded global guidance to Soldiers (real agents). Furthermore, we propose Policy Guidance Network (PGN), which can customize the encoded global guidance from Commander based on observations for each Soldier, providing each Soldier with specified guidance to the decision-making process. The Soldier takes into account not only the local action-observation histories but also the specified guidance from PGN when making decisions. We validate CSRL on the challenging StarCraft II micromanagement benchmark, proving that our approach can take advantage of intermittent global information to improve collaborative performance. Yiqun Chen 0004, Wei Yang 0041, Shiguang Wu 0001, Hongxing Chang |
IJCNN | 1 |
| 2021 | An Effective Implicit Multi-interest Interaction Network for Recommendation
Wei Yang 0041, Xinxin Fan, Yiqun Chen 0004, Feimo Li, Hongxing Chang |
ICONIP (4) | 3 |