Yuhang Tian 0002

dblp:174/1766-2 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
9since 2021 · last 2026
0009-0000-4726-9427ORCID · conflict

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Databases, data management, data science and information retrieval · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
YearPublicationVenuePosition
2026 ActiShade: Activating Overshadowed Knowledge to Guide Multi-Hop Reasoning in Large Language Models
abstract
In multi-hop reasoning, multi-round retrieval-augmented generation (RAG) methods typically rely on LLM-generated content as the retrieval query. However, these approaches are inherently vulnerable to knowledge overshadowing—a phenomenon where critical information is overshadowed during generation. As a result, the LLM-generated content may be incomplete or inaccurate, leading to irrelevant retrieval and causing error accumulation during the iteration process. To address this challenge, we propose ActiShade, which detects and activates overshadowed knowledge to guide large language models(LLMs) in multi-hop reasoning. Specifically, ActiShade iteratively detects the overshadowed keyphrase in the given query, retrieves documents relevant to both the query and the overshadowed keyphrase, and generates a new query based on the retrieved documents to guide the next-round iteration. By supplementing the overshadowed knowledge during the formulation of next-round queries while minimizing the introduction of irrelevant noise, ActiShade reduces the error accumulation caused by knowledge overshadowing. Extensive experiments show that ActiShade outperforms existing methods across multiple datasets and LLMs.
Huipeng Ma, Luan Zhang, Dandan Song 0005, Linmei Hu, Yuhang Tian 0002, Changzhi Zhou, Yizhou Jin, Shuhao Zhang 0001
AAAI5
2026 A Fact-Checking Framework with Denoising Evidence Retrieval and LLM-Based Debate Verification
abstract
The rapid spread of misinformation on social media has underscored the importance of automatic fact-checking. Existing fact-checking pipelines typically rely on multi-stage frameworks involving evidence retrieval and claim verification. However, these methods face two major challenges: (1) the retrieval process often introduces noisy evidence, which compromises the reliability of the final veracity prediction; and (2) the verification models may overlook critical factual details, resulting in hallucinated conclusions. To address these issues, we propose a fact-checking framework SLED with Self-supervised denoising evidence retrieval and LLM-Enhanced Debate-based verification. In the retrieval stage, SLED leverage trained verifier to assess credibility and necessity of retrieved evidence, enabling the elimination of noisy evidence. In the verification stage, SLED prompts the LLM to generate dual-perspective reasoning and simulates a multi-agent debate, followed by distillation into a lightweight model for final veracity prediction. Experiments on CHEF and HOVER datasets demonstrate that SLED achieves the state-of-the-art results in complex fact verification scenarios.
Yuhan Bai, Dandan Song 0005, Zhijing Wu 0001, Yuhang Tian 0002
WWW5
2026 Dual-Debias: A counterfactual inference framework for causally robust fact-checking
Dandan Song 0005, Zhijing Wu 0001, Yuhang Tian 0002
Neurocomputing4
2026 A Framework of Knowledge Graph-Enhanced Large Language Model Based on Global Planning
abstract
Knowledge graphs (KGs) can provide structured knowledge to assist large language models (LLMs) in interpretable reasoning. Knowledge graph question answering (KGQA) is a typical benchmark to evaluate KG-enhanced LLM methods. Previous methods of KG-enhanced LLMs for KGQA mainly include: 1) origin question-oriented methods, which perform KG retrieval based solely on the original question without explicitly analyzing multi-step reasoning logic; and 2) stepwise reasoning-oriented methods, which alternate between LLM generating the next reasoning step and targeted KG retrieval but lack systematic planning, leading to poor controllability. To tackle these limitations, we propose KELGoP, a framework of KG-enhanced LLM based on global planning. We propose fine-grained question categorization based on reasoning patterns and corresponding category-driven question decomposition for complex questions, enabling more controllable reasoning and atomic KG retrieval targeted to sub-questions. Furthermore, we propose an adaptive strategy that allows adjusting the reasoning pattern based on the performance of question answering, making the reasoning more flexible and robust. Finally, we introduce several efficient atomic KG retrieval strategies that operate on KG subgraphs to assist the LLM in answering atomic-level questions. A series of experiments on KGQA datasets demonstrate that our proposed framework achieves superior performance compared to existing baselines.
Yading Li, Dandan Song 0005, Yuhang Tian 0002, Hao Wang 0193, Changzhi Zhou, Shuhao Zhang 0001
IEEE Trans. Knowl. Data Eng.3
2025 CompKBQA: Component-wise Task Decomposition for Knowledge Base Question Answering
abstract
Yuhang Tian, Dandan Song, Zhijing Wu, Pan Yang, Changzhi Zhou, Jun Yang, Hao Wang, Huipeng Ma, Chenhao Li, Luan Zhang. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.
Yuhang Tian 0002, Dandan Song 0005, Zhijing Wu 0001, Changzhi Zhou, Hao Wang 0163, Huipeng Ma, Luan Zhang
EMNLP1
2025 Detecting Hallucination in Large Language Models Through Deep Internal Representation Analysis
abstract
Large language models (LLMs) have shown exceptional performance across various domains. However, LLMs are prone to hallucinate facts and generate non-factual responses, which can undermine their reliability in real-world applications. Current hallucination detection methods suffer from external resource demands, substantial time overhead, difficulty overcoming LLMs' intrinsic limitation, and insufficient modeling. In this paper, we propose MHAD, a novel internal-representation-based hallucination detection method. MHAD utilizes linear probing to select neurons and layers within LLMs. The selected neurons and layers are demonstrated with significant awareness of hallucinations at the initial and final generation steps. By concatenating the outputs from these selected neurons of selected layers at the initial and final generation steps, a hallucination awareness vector is formed, enabling precise hallucination detection via an MLP. Additionally, we introduce SOQHD, a novel benchmark for evaluating hallucination detection in Open-Domain QA (ODQA). Extensive experiments show that MHAD outperforms existing hallucination detection methods across multiple LLMs, demonstrating superior effectiveness.
Luan Zhang, Dandan Song 0005, Zhijing Wu 0001, Yuhang Tian 0002, Changzhi Zhou, Shuhao Zhang 0001
IJCAI4
2025 Overview of the NLPCC 2025 Shared Task 4: Multi-modal, Multilingual, and Multi-hop Medical Instructional Video Question Answering Challenge
Bin Li 0083, Shenxi Liu, Yixuan Weng, Yue Du, Yuhang Tian 0002, Shoujun Zhou
NLPCC (4)5
2025 Look one step ahead through first-order aggregation in reinforcement learning-based knowledge graph reasoning
Hao Wang 0163, Dandan Song 0005, Zhijing Wu 0001, Yuhang Tian 0002
Inf. Sci.4
2024 Span-Pair Interaction and Tagging for Dialogue-Level Aspect-Based Sentiment Quadruple Analysis
abstract
The Dialogue-level Aspect-based Sentiment Quadruple analysis (DiaASQ) task has recently received attention in the Aspect-Based Sentiment Analysis (ABSA) field. It aims to extract(target, aspect, opinion, sentiment) quadruples from multi-turn and multi-party dialogues. Compared to previous ABSA tasks focusing on text such as sentences, the DiaASQ task involves more complex contextual information and corresponding relations between terms, as well as longer sequences. These characteristics challenge existing methods that struggle to model explicit span-level interactions or have high computational costs. In this paper, we propose a span-pair interaction and tagging method to solve these issues, which includes a novel Span-pair Tagging Scheme (STS) and a simple and efficient Multi-level Representation Model (MRM). STS simplifies the DiaASQ task to a span-pair tagging task and explicitly captures complete span-level semantics by tagging span pairs. MRM efficiently models the dialogue structure information and span-level interactions by constructing multi-level contextual representation. Besides, we train a span ranker to improve the running efficiency of MRM. Extensive experiments on multilingual datasets demonstrate that our method outperforms existing state-of-the-art methods.
Changzhi Zhou, Zhijing Wu 0001, Dandan Song 0005, Linmei Hu, Yuhang Tian 0002
WWW5