TKFQA, a factuality consistency benchmark comprising 10,130 question-answering (QA) pairs grounded in tables, texts, and knowledge graphs, is introduced and ORLF, an LLM-agnostic training framework that models cross-context topological relations through knowledge-specific latent vectors is proposed.
Abstract
Large language models (LLMs) have increasingly supported response generation grounded in user-provided knowledge spanning heterogeneous structures. However, existing benchmarks provide limited assessment of whether LLMs can faithfully perform multi-hop reasoning chains across such knowledge contexts while remaining robust to variations in their input order. We introduce TKFQA, a factuality consistency benchmark comprising 10,130 question-answering (QA) pairs grounded in tables, texts, and knowledge graphs (KGs). Each example is constructed from an explicit counterfactual reasoning chain, enabling the joint evaluation of answer correctness, reasoning-chain accuracy, and robustness to different input-order. An extensive evaluation of 14 open- and closed-source LLMs reveals that state-of-the-art models exhibit limited reasoning-chain accuracy and remain sensitive to variations in the input order of heterogeneous knowledge contexts. To address these limitations, we propose ORLF, an LLM-agnostic training framework that models cross-context topological relations through knowledge-specific latent vectors. ORLF integrates context-wise position encoding, a latent-bridge attention mask, and topological knowledge bias to preserve knowledge-specific bias and encode topological semantics. Experiments across four LLM backbones show that ORLF outperforms competitive training-free and LoRA-based baselines, improving average Exact Match and Reasoning-Chain Accuracy by 2.15% and 4.29%, respectively, while reducing order-induced performance standard deviation by 0.04% to 3.01%.
REFACT is an adaptive fact-restatement citation framework that enables LLMs to determine when contextual grounding is needed and selectively restate source facts at appropriate levels of detail for reliable reasoning.
Zhensheng Jin, Xin Dai, Zhenghao Liu et al.· arXiv.org· 0 citations
This work delineates LLM reasoning boundaries and presents a new paradigm for fine-grained capability assessment, which suggests that genuine reasoning is demonstrated only when a model follows logical rules despite conflicting prior knowledge.
Fangfei Yan, Jianbo Yao, Michael K. Chen et al.· Proceedings of the 32nd ACM...· 1 citation
Grounded Reasoning in Dependency (GRiD) is introduced, a novel dependency-aware reasoning framework that explicitly grounds reasoning steps in structured knowledge that substantially improves reasoning accuracy, consistency, and faithfulness compared to recent state-of-the-art structured reasoning methods.
Xiangyu Wen, Min Li, Junhua Huang et al.· Neural Information Processin...· 2 citations
The introduction of CRiT-QA (Counterfactual Reasoning with Traps), a dataset explicitly designed to address both limitations of large language models' multi-hop reasoning, and provides a foundation for developing more reliable, evidence-grounded LLMs.
Jungmin Yun, Junehyoung Kwon, Youngbin Kim· Proceedings of the Language...· 0 citations
The proposed DR 2 identifies and localizes non-deterministic reasoning behaviors, uncovering the underlying semantic representation deficiencies in LLMs, and designs abductive reasoning-based preference learning, which promotes fine-grained semantic discrimination and mitigates non-deterministic reasoning errors.
Ge Liang, Mufan Xu, Kehai Chen et al.· Annual Meeting of the Associ...· 0 citations
This work proposes a framework that ensembles the reasoning structure, not just the answers, of multiple LLMs by weighted merging of Directed Acyclic Graphs (DAGs) extracted from reasoning chains by weighted merging of Directed Acyclic Graphs (DAGs) extracted from reasoning chains.
Amruta Parulekar, Jinu Lee, Dilek Z. Hakkani-Tür et al.· arXiv.org· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.