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

Yige Sun

dblp:349/6819 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
ranking
1.012026
Optimizing Generative Ranking Relevance via Reinforcement Learning in Xiaohongshu Search · KDD (1) 2026
Information retrieval › ranking › search relevance
relevance modeling
1.012026
Optimizing Generative Ranking Relevance via Reinforcement Learning in Xiaohongshu Search · KDD (1) 2026
Natural language and speech › Language models and text generation
chain-of-thought reasoning
0.312026
Optimizing Generative Ranking Relevance via Reinforcement Learning in Xiaohongshu Search · KDD (1) 2026

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

reinforcement learning · 2.0knowledge distillation · 2.0chain-of-thought prompting · 2.0
YearPublicationVenuePosition
2026 Optimizing Generative Ranking Relevance via Reinforcement Learning in Xiaohongshu Search
abstract
Ranking relevance is a fundamental task in search engines, aiming to identify the items most relevant to a given user query. Traditional relevance models typically produce scalar scores or directly predict relevance labels, limiting both interpretability and the modeling of complex relevance signals. Inspired by recent advances in Chain-of-Thought (CoT) reasoning for complex tasks, we investigate whether explicit reasoning can enhance both interpretability and performance in relevance modeling. However, existing reasoning-based Generative Relevance Models (GRMs) primarily rely on supervised fine-tuning on large amounts of human-annotated or synthetic CoT data, which often leads to limited generalization. Moreover, domain-agnostic, free-form reasoning tends to be overly generic and insufficiently grounded, limiting its potential to handle the diverse and ambiguous cases prevalent in open-domain search. In this work, we formulate relevance modeling in Xiaohongshu search as a reasoning task and introduce a Reinforcement Learning (RL)-based training framework to enhance the grounded reasoning capabilities of GRMs. Specifically, we incorporate practical business-specific relevance criteria into the multi-step reasoning prompt design and propose Stepwise Advantage Masking (SAM), a lightweight process-supervision strategy which facilitates effective learning of these criteria through improved credit assignment. To enable industrial deployment, we further distill the large-scale RL-tuned model to a lightweight version suitable for real-world search systems. Extensive offline evaluations and online A/B tests demonstrate that our approach consistently delivers significant improvements across key relevance and business metrics, validating its effectiveness, robustness, and practicality for large-scale industrial search systems.
Ziyang Zeng, Heming Jing, Jindong Chen, Yige Sun, Zheyong Xie, Shaosheng Cao, Yao Hu 0002
KDD (1)8
2023 Deep learning versus conventional methods for missing data imputation: A review and comparative study
Yige Sun, Jing Li 0002
Expert Syst. Appl.1