CLOct 15, 2025

BRIEF-Pro: Universal Context Compression with Short-to-Long Synthesis for Fast and Accurate Multi-Hop Reasoning

arXiv:2510.13799v1h-index: 20
Originality Incremental advance
AI Analysis

This work addresses the problem of slow and inefficient context processing in RAG systems for complex multi-hop questions, offering a lightweight solution that enhances performance across various language models, though it is incremental as it builds on existing compression methods.

The paper tackles the bottleneck of high latency and cognitive load in retrieval-augmented generation (RAG) for multi-hop reasoning by introducing BRIEF-Pro, a universal context compressor that distills relevant evidence into concise summaries, improving QA performance by 4.67% on average with 32x compression while reducing computational overhead by 77% compared to a baseline.

As retrieval-augmented generation (RAG) tackles complex tasks, increasingly expanded contexts offer richer information, but at the cost of higher latency and increased cognitive load on the model. To mitigate this bottleneck, especially for intricate multi-hop questions, we introduce BRIEF-Pro. It is a universal, lightweight compressor that distills relevant evidence for a given query from retrieved documents into a concise summary for seamless integration into in-context RAG. Using seed data consisting of relatively short contexts (fewer than 1k words), BRIEF-Pro is trained to perform abstractive compression of extended contexts exceeding 10k words across a wide range of scenarios. Furthermore, BRIEF-Pro offers flexible user control over summary length by allowing users to specify the desired number of sentences. 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. With the 70B reader model, 32x compression by BRIEF-Pro improves QA performance by 4.67% on average over LongLLMLingua's 9x, while requiring only 23% of its computational overhead.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes