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

Kepu Zhang

dblp:330/9095 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
9since 2021 · last 2026
—ORCID · conflict

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

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

Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Artificial intelligence
2 papers
Segmentation and scene understanding · 46% Language models and text generation · 30% Vision and language · 23%

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

TopicWeightPapersLastEvidence papers
Information retrieval › query reformulation
query correction
1.922026
QE-RAG: A Robust Retrieval-Augmented Generation Benchmark for Query Entry Errors · SIGIR 2026
Trigger3: Refining Query Correction via Adaptive Model Selector · AAAI 2025
Information retrieval
query processing
1.922026
QE-RAG: A Robust Retrieval-Augmented Generation Benchmark for Query Entry Errors · SIGIR 2026
Trigger3: Refining Query Correction via Adaptive Model Selector · AAAI 2025
Information retrieval
retrieval-augmented generation
1.012026
QE-RAG: A Robust Retrieval-Augmented Generation Benchmark for Query Entry Errors · SIGIR 2026
Information retrieval › retrieval-augmented generation
robust retrieval-augmented generation
1.012026
QE-RAG: A Robust Retrieval-Augmented Generation Benchmark for Query Entry Errors · SIGIR 2026
Natural language and speech › Language models and text generation
large language model
0.912025
Trigger3: Refining Query Correction via Adaptive Model Selector · AAAI 2025
Computer vision › Vision and language
multimodal fusion
0.712023
Does Thermal Really Always Matter for RGB-T Salient Object Detection? · IEEE Trans. Multim. 2023
Computer vision › Segmentation and scene understanding › saliency detection › salient object detection
RGB-T salient object detection
0.712023
Does Thermal Really Always Matter for RGB-T Salient Object Detection? · IEEE Trans. Multim. 2023
Computer vision › Segmentation and scene understanding › saliency detection
salient object detection
0.712023
Does Thermal Really Always Matter for RGB-T Salient Object Detection? · IEEE Trans. Multim. 2023
Information retrieval
evaluation
0.312026
QE-RAG: A Robust Retrieval-Augmented Generation Benchmark for Query Entry Errors · SIGIR 2026
Information retrieval › evaluation › benchmark
robustness benchmark
0.312026
QE-RAG: A Robust Retrieval-Augmented Generation Benchmark for Query Entry Errors · SIGIR 2026
Information retrieval
search engines
0.312025
Trigger3: Refining Query Correction via Adaptive Model Selector · AAAI 2025

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

model selection · 1.7large language model · 1.7robust retriever training · 1.0contrastive learning · 1.0two-stage localization · 0.7semantic constraints · 0.7global illumination estimation · 0.7
YearPublicationVenuePosition
2026 QE-RAG: A Robust Retrieval-Augmented Generation Benchmark for Query Entry Errors
abstract
Current benchmarks evaluate the performance of RAG methods from various perspectives, they share a common assumption that user queries used for retrieval are error-free. However, in real-world interactions between users and LLMs, query entry errors are frequent. The impact of these errors on current RAG methods against such errors remains largely unexplored. To bridge this gap, we propose QE-RAG, the first robust RAG benchmark designed specifically to evaluate performance against query entry errors. We analyze the impact of these errors on LLM outputs and find that corrupted queries degrade model performance, which can be mitigated through query correction and training a robust retriever for retrieving relevant documents. Based on these insights, we propose a contrastive learning-based robust retriever training method and a retrieval-augmented query correction method. Extensive experiments reveal that: (1) state-of-the-art RAG methods including sequential, branching, and iterative methods, exhibit poor robustness to query entry errors; (2) our method enhances the robustness of RAG when handling query entry errors and it's compatible with existing RAG methods, further improving their robustness.
Kepu Zhang, Zhongxiang Sun, Weijie Yu 0003, Xiaoxue Zang, Kai Zheng 0001, Yang Song 0008, Han Li 0005, Jun Xu 0001
SIGIR1
2026 Empowering open-domain LLMs for legal document correction via legal knowledge integration and decoding constraints
Kepu Zhang, Weijie Yu 0003, Zhongxiang Sun, Weicong Qin, Jun Xu 0001, Ji-Rong Wen
Inf. Process. Manag.1
2025 Trigger3: Refining Query Correction via Adaptive Model Selector
abstract
In search scenarios, user experience can be hindered by erroneous queries due to typos, voice errors, or knowledge gaps. Therefore, query correction is crucial for search engines. Current correction models, usually small models trained on specific data, often struggle with queries beyond their training scope or those requiring contextual understanding. While the advent of Large Language Models (LLMs) offers a potential solution, they are still limited by their pre-training data and inference cost, particularly for complex queries, making them not always effective for query correction. To tackle these, we propose Trigger3, a large-small model collaboration framework that integrates the traditional correction model and LLM for query correction, capable of adaptively choosing the appropriate correction method based on the query and the correction results from the traditional correction model and LLM. Trigger3 first employs a correction trigger to filter out correct queries. Incorrect queries are then corrected by the traditional correction model. If this fails, an LLM trigger is activated to call the LLM for correction. Finally, for queries that no model can correct, a fallback trigger decides to return the original query. Extensive experiments demonstrate Trigger3 outperforms correction baselines while maintaining efficiency.
Kepu Zhang, Zhongxiang Sun, Xiao Zhang 0034, Xiaoxue Zang, Kai Zheng 0001, Yang Song 0008, Jun Xu 0001
AAAI1
2025 SyLeR: A Framework for Explicit Syllogistic Legal Reasoning in Large Language Models
abstract
Syllogistic reasoning is a fundamental aspect of legal decision-making, enabling logical conclusions by connecting general legal principles with specific case facts. Although existing large language models (LLMs) can generate responses to legal questions, they fail to perform explicit syllogistic reasoning, often producing implicit and unstructured answers that lack explainability and trustworthiness. To address this limitation, we propose SyLeR, a novel framework that empowers LLMs to engage in explicit syllogistic legal reasoning. SyLeR integrates a tree-structured hierarchical retrieval mechanism to effectively combine relevant legal statutes and precedent cases, forming comprehensive major premises. This is followed by a two-stage fine-tuning process: supervised fine-tuning warm-up establishes a foundational understanding of syllogistic reasoning, while reinforcement learning with a structure-aware reward mechanism refines the model's ability to generate diverse logically sound and well-structured reasoning paths. We conducted extensive experiments across various dimensions, including in-domain and cross-domain user groups (legal laypersons and practitioners), multiple languages (Chinese and French), and different LLM backbones (legal-specific and open-domain LLMs). The results show that SyLeR significantly improves response accuracy and consistently delivers explicit, explainable, and trustworthy legal reasoning.
Kepu Zhang, Weijie Yu 0003, Zhongxiang Sun, Jun Xu 0001
CIKM1
2025 PrLM: Learning Explicit Reasoning for Personalized RAG via Contrastive Reward Optimization
abstract
Personalized retrieval-augmented generation (RAG) aims to produce user-tailored responses by incorporating retrieved user profiles alongside the input query. Existing methods primarily focus on improving retrieval and rely on large language models (LLMs) to implicitly integrate the retrieved context with the query. However, such models are often sensitive to retrieval quality and may generate responses that are misaligned with user preferences. To address this limitation, we propose PrLM, a reinforcement learning framework that trains LLMs to explicitly reason over retrieved user profiles. Guided by a contrastively trained personalization reward model, PrLM effectively learns from user responses without requiring annotated reasoning paths. Experiments on three personalized text generation datasets show that PrLM outperforms existing methods and remains robust across varying numbers of retrieved profiles and different retrievers.
Kepu Zhang, Teng Shi, Weijie Yu 0003, Jun Xu 0001
CIKM1
2025 Uncertainty-aware evidential learning for legal case retrieval with noisy correspondence
Weicong Qin, Weijie Yu 0003, Kepu Zhang, Haiyuan Zhao, Jun Xu 0001, Ji-Rong Wen
Inf. Sci.3
2024 SAQRec: Aligning Recommender Systems to User Satisfaction via Questionnaire Feedback
abstract
In real-world recommender systems, user engagement and subjective feedback play pivotal roles in shaping the content distribution mechanism of the platform. When platforms reach a certain scale, they often gather valuable questionnaire feedback data from users to evaluate their satisfaction with recommended items. Compared to traditional user feedback such as likes, questionnaires explicitly capture both satisfaction and dissatisfaction and are unaffected by other users' questionnaires, thus better expressing users' true preferences. In this paper, we aim to leverage the questionnaire feedback to align the recommendation model with users' true preferences. However, due to the platform distribution mechanism and divergent user attitudes toward questionnaires, the questionnaire feedback data frequently becomes sparse and exhibits selection biases, resulting in challenges in feature integration and training process. To address these issues, we introduce a novel user Satisfaction Alignment framework that effectively leverages Questionnaire feedback to enhance Recommendation, named SAQRec. SAQRec begins by training an unbiased satisfaction model to impute satisfaction, addressing selection bias and data sparsity. Then, SAQRec aligns features with users' true preferences by disentangling satisfaction and dissatisfaction from click history and categorizing clicked items into multiple satisfaction levels through the imputed satisfactions. Additionally, the imputed satisfactions from the pre-trained unbiased satisfaction model serve as pseudo-labels to align the model's outputs with users' true preferences. Extensive experiments on both public and commercial datasets demonstrate SAQRec's superior integration of questionnaire feedback in recommendation models. Online A/B testing on a short video platform confirms its effectiveness in boosting user watch time and positive-to-negative feedback ratio, enhancing overall performance and user satisfaction.
Kepu Zhang, Teng Shi, Sunhao Dai, Xiao Zhang 0034, Yinfeng Li, Xiaoxue Zang, Yang Song 0008, Jun Xu 0001
CIKM1
2024 Logic Rules as Explanations for Legal Case Retrieval
abstract
In this paper, we address the issue of using logic rules to explain the results from legal case retrieval. The task is critical to legal case retrieval because the users (e.g., lawyers or judges) are highly specialized and require the system to provide logic, faithful, and interpretable explanations before making legal decisions. Recently, research efforts have been made to learn explainable legal case retrieval models. However, these methods usually select rationales (key sentences) from the legal cases as explanations, failing to provide faithful and logicly correct explanations. In this paper, we propose Neural-Symbolic enhanced Legal Case Retrieval (NS-LCR), a framework that explicitly conducts reasoning on the matching of legal cases through learning case-level and law-level logic rules. The learned rules are then integrated into the retrieval process in a neuro-symbolic manner. Benefiting from the logic and interpretable nature of the logic rules, NS-LCR is equipped with built-in faithful explainability. We also show that NS-LCR is a model-agnostic framework that can be plug-in for multiple legal retrieval models. To demonstrate the superiority of NS-LCR, we extend the benchmarks of LeCaRD and ELAM with manually annotated logic rules and propose a new explainability measure based on Large Language Models (LLMs). Extensive experiments show that NS-LCR can achieve state-of-the-art ranking performances, and the empirical analysis also showed that NS-LCR is capable of providing faithful explanations for legal case retrieval.
Zhongxiang Sun, Kepu Zhang, Weijie Yu 0003, Jun Xu 0001
LREC/COLING2
2023 Does Thermal Really Always Matter for RGB-T Salient Object Detection?
abstract
In recent years, RGB-T salient object detection (SOD) has attracted continuous attention, which makes it possible to identify salient objects in environments such as low light by introducing thermal image. However, most of the existing RGB-T SOD models focus on how to perform cross-modality feature fusion, ignoring whether thermal image is really always matter in SOD task. Starting from the definition and nature of this task, this paper rethinks the connotation of thermal modality, and proposes a network named TNet to solve the RGB-T SOD task. In this paper, we introduce a global illumination estimation module to predict the global illuminance score of the image, so as to regulate the role played by the two modalities. In addition, considering the role of thermal modality, we set up different cross-modality interaction mechanisms in the encoding phase and the decoding phase. On the one hand, we introduce a semantic constraint provider to enrich the semantics of thermal images in the encoding phase, which makes thermal modality more suitable for the SOD task. On the other hand, we introduce a two-stage localization and complementation module in the decoding phase to transfer object localization cue and internal integrity cue in thermal features to the RGB modality. Extensive experiments on three datasets show that the proposed TNet achieves competitive performance compared with 20 state-of-the-art methods.
Runmin Cong, Kepu Zhang, Chen Zhang 0013, Feng Zheng 0001, Yao Zhao 0001, Qingming Huang, Sam Kwong
IEEE Trans. Multim.2