IterCOMP: Reasoning-aware Adaptive Prompt Compression for Multi-hop Question Answering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing prompt compression methods are designed for single-turn queries and fail to capture interdependent reasoning steps. |
| Approach: | They propose a unified, training-free prompt compression framework that integrates multi-hop reasoning within an iterative compression loop. |
| Outcome: | Experiments on MusiQue, 2WikiMultiHopQA, and HotpotQA show that iterCOMP achieves significant improvements in Exact Match and F1 scores while reducing the token budget. |
Similar Papers
BRIEF: Bridging Retrieval and Inference for Multi-hop Reasoning via Compression (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to augment language models with external knowledge but they are limited by static nature of pre-training data. |
| Approach: | They propose a lightweight approach that compresses retrieved documents into highly dense textual summaries to integrate into in-context RAG. |
| Outcome: | The proposed approach reduces latency and costs while achieving high performance in open-domain questions. |
BRIEF-Pro: Universal Context Compression with Short-to-Long Synthesis for Fast and Accurate Multi-Hop Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Experiments show that BRIEF-Pro generates more concise and relevant summaries, enhancing performance across small, large, and proprietary language models. |
| Approach: | They propose a universal, lightweight compressor that distills relevant evidence from retrieved documents into a concise summary for seamless integration into in-context RAG. |
| Outcome: | Experiments on four open-domain multi-hop question-answering datasets show that BRIEF-Pro generates more concise and relevant summaries, enhancing performance across small, large, and proprietary language models. |
CompAct: Compressing Retrieved Documents Actively for Question Answering (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to condense extensive documents with no loss of information are difficult to implement in real-world scenarios. |
| Approach: | They propose a framework that employs an active strategy to condense extensive documents without losing key information. |
| Outcome: | The proposed framework improves performance and compression rate on multi-hop question-answering benchmarks. |
From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) have recently exhibited performance gains owing to a wide variety of prompting techniques, including Retrieval-Augmented Generation (RAG), Chain-of-Thought (CoT), and In-Context Learning (ICL). |
| Approach: | They propose a prompt compression method that captures the global context without compromising semantic consistency while detouring the necessity of pseudo-labels for training the compressor. |
| Outcome: | Empirical results show that the proposed method retains key contexts while reducing the prompt length by 80%. |
Resource-Friendly Dynamic Enhancement Chain for Multi-Hop Question Answering (2025.findings-acl)
Copied to clipboard
Binquan Ji, Haibo Luo, YifeiLu YifeiLu, Lei Hei, Jiaqi Wang, Tingjing Liao, Wang Lingyu, Shichao Wang, Feiliang Ren
| Challenge: | Existing approaches to solve multi-hop question answering challenges require multiple rounds of retrieval and iterative generation. |
| Approach: | They propose a framework that decomposes complex questions into coherent subquestions . it then iteratively refines these subquests through context-aware rewriting to generate effective query formulations. |
| Outcome: | The proposed framework performs on par with or surpasses state-of-the-art benchmarks while significantly reducing token consumption. |
GRITHopper: Decomposition-Free Multi-Hop Dense Retrieval (2026.eacl-long)
Copied to clipboard
| Challenge: | Decomposition-based multi-hop retrieval methods rely on autoregressive steps to break down complex queries, which breaks end-to-end differentiability and is computationally expensive. |
| Approach: | They propose a multi-hop dense retrieval model that integrates causal language modeling with dense retrievals. |
| Outcome: | The proposed model outperforms existing methods on in-distribution and out-of-difference benchmarks. |
Locate Then Ask: Interpretable Stepwise Reasoning for Multi-hop Question Answering (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for multi-hop reasoning ignore grounding on supporting facts of each step, which tends to generate inaccurate decompositions. |
| Approach: | They propose an interpretable stepwise reasoning framework that incorporates supporting sentences and questions at each intermediate step and utilizes the inference of the current hop for the next until reasoning out the final result. |
| Outcome: | The proposed model can boost performance and yield a better interpretable reasoning process without decomposition supervision. |
Style-Compress: An LLM-Based Prompt Compression Framework Considering Task-Specific Styles (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Prompt compression reduces inference time and costs while maintaining informativeness for different usage scenarios. |
| Approach: | They propose a framework that adapts a smaller language model to compress prompts for a larger model on a new task without additional training. |
| Outcome: | The proposed framework outperforms two baseline models in four tasks . iteratively generates and selects effective compressed prompts as task-specific demonstrations . |
Unsupervised Alignment-based Iterative Evidence Retrieval for Multi-hop Question Answering (2020.acl-main)
Copied to clipboard
| Challenge: | Evidence retrieval is a critical stage of question answering (QA) . Several multi-hop QA datasets have been proposed recently . |
| Approach: | They propose an unsupervised method that uses only GloVe embeddings to soft-align questions with justification sentences and an iterative process that reformulates queries focusing on terms that are not covered by existing justifications. |
| Outcome: | The proposed method outperforms all previous methods on the evidence selection task on two datasets: MultiRC and QASC. |
Self-Critique Guided Iterative Reasoning for Multi-hop Question Answering (2025.findings-acl)
Copied to clipboard
Zheng Chu, Huiming Fan, Jingchang Chen, Qianyu Wang, Mingda Yang, Jiafeng Liang, Zhongjie Wang, Hao Li, Guo Tang, Ming Liu, Bing Qin
| Challenge: | Large language models (LLMs) have demonstrated remarkable reasoning capabilities, but they still face challenges in knowledge-intensive multi-hop reasoning. |
| Approach: | They propose a method that uses self-critique feedback to guide iterative reasoning by enabling iteration and self-evaluation of its intermediate reasoning steps. |
| Outcome: | The proposed method surpasses the previous SOTA by 8.6% on three multi-hop reasoning datasets. |