paper-with-me

홈 › Papers

Call Me When Necessary: LLMs can Efficiently and Faithfully Reason over Structured Environments

2024-03-13 · Sitao Cheng, Ziyuan Zhuang, Yong Xu, Fangkai Yang, Chaoyun Zhang, Xiaoting Qin, Xiang Huang, Ling Chen, QIngwei Lin, Dongmei Zhang, Saravan Rajmohan, Qi Zhang

Large Language Models (LLMs) have shown potential in reasoning over structured environments, e.g., knowledge graph and table. Such tasks typically require multi-hop reasoning, i.e., match natural language utterance with instances in the environment. Previous methods leverage LLMs to incrementally build a reasoning path, where the LLMs either invoke tools or pick up schemas by step-by-step interacting with the environment. We propose Reasoning-Path-Editing (Readi), a novel framework where LLMs can efficiently and faithfully reason over structured environments. In Readi, LLMs initially generate a reasoning path given a query, and edit the path only when necessary. We instantiate the path on structured environments and provide feedback to edit the path if anything goes wrong. Experimental results on three KGQA and two TableQA datasets show the effectiveness of Readi, significantly surpassing previous LLM-based methods (by 9.1% Hit@1 on WebQSP, 12.4% on MQA-3H and 9.5% on WTQ), comparable with state-of-the-art fine-tuned methods (67% on CWQ and 74.7% on WebQSP) and substantially boosting the vanilla LLMs (by 14.9% on CWQ). Our code will be available on https://aka.ms/readi.

📄 PDF Abstract BibTeX arXiv:2403.08593

Code (1)

sitaocheng/Knowledge_Interplay

Similar Papers 제목 키워드 기반

Can Large Language Models Faithfully Express Their Intrinsic Uncertainty in Words?

2024-05-27 · Gal Yona, Roee Aharoni, Mor Geva

We posit that large language models (LLMs) should be capable of expressing their intrinsic uncertainty in natural language. For example, if the LLM is equally likely to output two contradicting answers to the same questi…

Question Answering

Learning the effective order of a hypergraph dynamical system

2023-06-02 · Leonie Neuhäuser, Michael Scholkemper, Francesco Tudisco, Michael T. Schaub

Dynamical systems on hypergraphs can display a rich set of behaviours not observable for systems with pairwise interactions. Given a distributed dynamical system with a putative hypergraph structure, an interesting quest…

Evaluating the Elementary Multilingual Capabilities of Large Language Models with MultiQ

2024-03-06 · Carolin Holtermann, Paul Röttger, Timm Dill, Anne Lauscher

Large language models (LLMs) need to serve everyone, including a global majority of non-English speakers. However, most LLMs today, and open LLMs in particular, are often intended for use in just English (e.g. Llama2, Mi…

Open-Ended Question AnsweringQuestion Answering

Teaching Language Models to Faithfully Express their Uncertainty

2025-10-14 · Bryan Eikema, Evgenia Ilia, José G. C. de Souza, Chrysoula Zerva 외 arxiv

Large language models (LLMs) often miscommunicate their uncertainty: repeated queries can produce divergent answers, yet generated responses are typically unhedged or hedged in ways that do not reflect this variability. …

Open-Domain Question Answering

SPEX: Scaling Feature Interaction Explanations for LLMs

2025-02-19 · Justin Singh Kang, Landon Butler, Abhineet Agarwal, Yigit Efe Erginbas 외

Large language models (LLMs) have revolutionized machine learning due to their ability to capture complex interactions between input features. Popular post-hoc explanation methods like SHAP provide marginal feature attri…