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.

Yuanhai Xue

dblp:76/10289 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
decision-theoretic retrieval
0.912025
Training a Utility-based Retriever Through Shared Context Attribution for Retrieval-Augmented Language Models · EMNLP 2025
Information retrieval
retrieval-augmented generation
0.912025
Training a Utility-based Retriever Through Shared Context Attribution for Retrieval-Augmented Language Models · EMNLP 2025
Information retrieval
retrieval models
0.912025
Training a Utility-based Retriever Through Shared Context Attribution for Retrieval-Augmented Language Models · EMNLP 2025
Information retrieval › retrieval models
retrieval model training
0.912025
Training a Utility-based Retriever Through Shared Context Attribution for Retrieval-Augmented Language Models · EMNLP 2025
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.312025
Training a Utility-based Retriever Through Shared Context Attribution for Retrieval-Augmented Language Models · EMNLP 2025

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

perturbation-based attribution · 1.7multi-task learning · 1.7
YearPublicationVenuePosition
2025 Training a Utility-based Retriever Through Shared Context Attribution for Retrieval-Augmented Language Models
abstract
Retrieval-Augmented Language Models boost task performance, owing to the retriever that provides external knowledge.Although crucial, the retriever primarily focuses on semantics relevance, which may not always be effective for generation.Thus, utility-based retrieval has emerged as a promising topic, prioritizing passages that provide valid benefits for downstream tasks.However, due to insufficient understanding, capturing passage utility accurately remains unexplored.This work proposes SCARLet, a framework for training utility-based retrievers in RALMs, which incorporates two key factors, multi-task generalization and inter-passage interaction.First, SCAR-Let constructs shared context on which training data for various tasks is synthesized.This mitigates semantic bias from context differences, allowing retrievers to focus on learning task-specific utility and generalize across tasks.Next, SCARLet uses a perturbation-based attribution method to estimate passage-level utility for shared context, which reflects interactions between passages and provides more accurate feedback.We evaluate our approach on ten datasets across various tasks, both indomain and out-of-domain, showing that retrievers trained by SCARLet consistently improve the overall performance of RALMs.
Yilong Xu, Jinhua Gao, Xiaoming Yu, Yuanhai Xue, Baolong Bi, Huawei Shen, Xueqi Cheng 0001
EMNLP4
2024 Disentangled Graph Representation with Contrastive Learning for Rumor Detection
abstract
With many social problems nowadays, rumor detection in social media has become increasingly important. Previous works proposed classical and deep learning methods to extract information from features or rumor propagation structures. However, these methods either require lots of labeled data or are disturbed by noise nodes easily. To address these challenges, we propose a novel method that Disentangles graph representations with Contrastive learning for Rumor Detection (DCRD). Specifically, we design a graph contrastive learning strategy, significantly reducing the requirement of labeled data. We disentangle attention and redundant graph representations to extract intrinsic features and exclude the influence of redundant information. In addition, we utilize the disentangled two parts as hard negative samples to enhance contrastive learning further. Experiment results on two real-world datasets show that DCRD outperforms state-of-the-art models. More validation experiments demonstrate the data efficiency and robustness of our method.
Yuanhai Xue, Xiaoming Yu
ICASSP2
2022 SCIEnt: A Semantic-Feature-Based Framework for Core Information Extraction from Web Pages
Yan Guo 0001, Yangyuanxiang Xu, Yuanhai Xue, Huawei Shen, Xueqi Cheng 0001
ICONIP (3)4