Topology-of-Question-Decomposition: Enhancing Large Language Models with Information Retrieval for Knowledge-Intensive Tasks (2025.coling-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) are constrained to chaining immediate reasoning steps and relying solely on parametric knowledge. |
| Approach: | They propose a framework that activates retrieval only when necessary to improve answer accuracy. |
| Outcome: | Experiments show that the proposed framework improves performance in knowledge-intensive tasks. |
Similar Papers
DIVKNOWQA: Assessing the Reasoning Ability of LLMs via Open-Domain Question Answering over Knowledge Base and Text (2024.findings-naacl)
Copied to clipboard
| Challenge: | Retrievalaugmented LLMs have been used to ground LLM in external knowledge . a gap exists in the current landscape regarding the effectiveness of grounding LLM on heterogeneous knowledge sources. |
| Approach: | They propose a model that uses symbolic language to generate symbolic queries . they use a dataset that is generated using predefined reasoning chains and human annotation . |
| Outcome: | The proposed model outperforms previous approaches by a significant margin in QA tasks over text. |
A Framework of Knowledge Graph-Enhanced Large Language Model Based on Question Decomposition and Atomic Retrieval (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to enhance LLMs with knowledge graphs have limited results . knowledge graph question answering (KGQA) provides interpretable reasoning for large language models . |
| Approach: | They propose a framework for KG-enhanced LLM based on question decomposition and atomic retrieval . they propose question decomposing tree as framework for LLM reasoning . |
| Outcome: | The proposed framework outperforms existing reasoning-based baselines on KGQA datasets. |
TreeRare: Syntax Tree-Guided Retrieval and Reasoning for Knowledge-Intensive Question Answering (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing work shows that large language models generate incorrect statements due to over-reliance on parametric knowledge. |
| Approach: | They propose a framework that utilizes syntax trees to guide information retrieval and reasoning for question answering. |
| Outcome: | The proposed framework improves on existing state-of-the-art methods for large-scale query processing. |
Decomposition for Enhancing Attention: Improving LLM-based Text-to-SQL through Workflow Paradigm (2024.findings-acl)
Copied to clipboard
Yuanzhen Xie, Xinzhou Jin, Tao Xie, Matrixmxlin Matrixmxlin, Liang Chen, Chenyun Yu, Cheng Lei, Chengxiang Zhuo, Bo Hu, Zang Li
| Challenge: | In-context learning of large-language models has achieved remarkable success in the field of natural language processing . however, the single-step chain-of-thought prompting approach faces challenges such as attention diffusion and inadequate performance in complex tasks like text-to-SQL. |
| Approach: | They propose a workflow paradigm method to enhance the attention and problem-solving scope of large-language models through decomposition. |
| Outcome: | The proposed method outperforms existing methods on three datasets and improves the upper limit of LLM-based approaches. |
Decomposing Complex Queries for Tip-of-the-tongue Retrieval (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Tip-of-the-tongue retrieval is a retrieval setting in which a user is unable to formulate a precise query that identifies a sought item . a framework that decomposes complex queries into subqueries can improve gold book recall . |
| Approach: | They propose a framework for handling tip-of-the-tongue queries by decomposing queries into individual clues routing them to specialized retrievers. |
| Outcome: | The proposed framework improves gold book recall up to 6% on a new query-book pair . it takes advantage of off-the-shelf retrievers or incorporates retriever-specific logic . |
A Survey of Reasoning-Intensive Retrieval: Progress and Challenges (2026.acl-long)
Copied to clipboard
| Challenge: | Reasoning-Intensive Retrieval (RIR) targets retrieval settings where relevance is mediated by latent inferential links between a query and supporting evidence, rather than semantic similarity. |
| Approach: | They propose a taxonomy that categorizes methods based on where and how reasoning is integrated into the retrieval pipeline. |
| Outcome: | The proposed method framework provides a detailed analysis of the current landscape and its trade-offs and practical applications. |
Corpus-Steered Query Expansion with Large Language Models (2024.eacl-short)
Copied to clipboard
| Challenge: | Recent studies show query expansions generate hypothetical documents that answer queries as expansions. |
| Approach: | They propose a corpus-steered query expansion to promote incorporation of knowledge embedded within the corpus. |
| Outcome: | et al. analyzed corpus-based Query Expansion (CSQE) using LLMs to generate hypothetical documents that answer the query. |
Context-Efficient Retrieval with Factual Decomposition (2025.naacl-short)
Copied to clipboard
| Challenge: | Existing models that use dynamically expanding text can be incorporated into large language models. |
| Approach: | They show that pre-processing external corpus into semi-structured "atomic facts" reduces the size of the context and improves inference efficiency. |
| Outcome: | The proposed form of atomic facts improves on question answering tasks when the amount of retrieved text is limited. |
Is a Question Decomposition Unit All We Need? (2022.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LMs) have achieved state-of-the-art performance on many NLP benchmarks. |
| Approach: | They propose to decompose a hard question into simpler questions that are easier for models to answer. |
| Outcome: | The proposed approach significantly improves model performance (24% for GPT3 and 29% for RoBERTa-SQuAD along with a symbolic calculator) by decomposing a hard question into simpler questions that are easier for models to answer. |
Retrieval and Reasoning on KGs: Integrate Knowledge Graphs into Large Language Models for Complex Question Answering (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have performed impressively in various NLP tasks, but their inherent hallucination phenomena severely challenge their credibility in complex reasoning. |
| Approach: | They propose to integrate explainable Knowledge Graphs (KGs) with LLMs to alleviate hallucinations . they construct subgraphs to enhance the retrieval capabilities of KGs via CoT reasoning. |
| Outcome: | Extensive experiments on two KGQA datasets show that the proposed model achieves convincing performance compared to strong baselines. |