Challenge: Long-document Question Answering (QA) challenges with large-scale text and long-distance dependencies.
Approach: They propose a method that leverages large language models to control retrieval process . they propose 'attention-based' retrieval methods that construct hierarchical graphs .
Outcome: The proposed method achieves LLM-level performance while maintaining computational complexity comparable to RAG methods.

Similar Papers

Adaptive-RAG: Learning to Adapt Retrieval-Augmented Large Language Models through Question Complexity (2024.naacl-long)

Copied to clipboard

Challenge: Recent Large Language Models (LLMs) generate factually incorrect answers based on their parametric memory.
Approach: They propose a retrieval-augmented large language model that can dynamically select the most suitable strategy based on query complexity.
Outcome: The proposed approach improves the performance of QA systems on open-domain QA datasets.
LLM-Independent Adaptive RAG: Let the Question Speak for Itself (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to retrieve Large Language Models (LLMs) are inefficient and impractical.
Approach: They propose a lightweight adaptive retrieval method that leverages external information to achieve comparable quality while achieving significant efficiency gains.
Outcome: The proposed methods achieve comparable quality while achieving significant efficiency gains on 6 QA datasets.
GRIL: Knowledge Graph Retrieval-Integrated Learning with Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing graph RAGs decouple retrieval and reasoning processes, preventing adaptability . existing graph Raggings depend heavily on ground-truth entities, which are often unavailable in open-domain settings.
Approach: They propose a graph retriever that is trained end-to-end with large-scale graphs . structure and semantic features are encoded via soft tokens and the verbalized graph .
Outcome: The proposed approach improves the performance of large-scale graph retrieval models by grounding it with external knowledge.
Graph of Records: Boosting Retrieval Augmented Generation for Long-context Summarization with Graphs (2025.acl-long)

Copied to clipboard

Challenge: Existing methods for retrieving historical LLM responses are lacking in long-context summarization tasks.
Approach: They propose a graph of records which leverages historical LLM responses to enhance RAG for long-context global summarization.
Outcome: The proposed method improves on four long-context summarization datasets.
CtrlA: Adaptive Retrieval-Augmented Generation via Inherent Control (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods focus on detecting LLM’s confidence via statistical uncertainty.
Approach: They propose to use a representation perspective to solve adaptive RAG by enabling dynamic retrieval during generation and enabling retrieval only when the query exceeds LLM's internal knowledge.
Outcome: The proposed framework is superior to existing adaptive RAG methods on a diverse set of tasks.
TC–RAG: Turing–Complete RAG’s Case study on Medical LLM Systems (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to RAG neglect system state variables, resulting in poor performance and erroneous knowledge accumulation.
Approach: They propose a framework that incorporates a Turing Complete System to manage state variables and manage retrieval halting.
Outcome: The proposed framework improves on seven real-world healthcare datasets and shows that it is more accurate than existing methods.
HiGoE: Hierarchical Graph of Evidence to Enhance Retrieval-Augmented Generation for Long-context Summarization (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for long-context summarization fail to capture high-level thematic structures and long-range dependencies.
Approach: They propose a hierarchical Graph of Evidence to reduce hallucination and attention dilution by replacing unreliable chunk-based methods with a filtered proposition–evidence graph.
Outcome: Experiments show that HiGoE surpasses baselines in quality and efficiency.
StitchLLM: Serving LLMs, One Block at a Time (2025.acl-long)

Copied to clipboard

Challenge: Existing techniques like distillation and pruning are not efficient for large language models.
Approach: They propose a dynamic model routing framework that uses a powerful bottom model to process all queries and a lightweight routing mechanism to allocate computational resources appropriately.
Outcome: The proposed framework improves system throughput while minimizing performance degradation.
MS-RAG: Simple and Effective Multi-Semantic Retrieval-Augmented Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for large language models suffer from poor indexing and inference speed . graph-based RAGs heavily rely on LLM for retrieval thus inference slow .
Approach: They propose retrieval-augmented generation (RAG) which integrates knowledge with dense vectors to build a multi-semantic RAG.
Outcome: The proposed method achieves state-of-the-art performance with faster inference speed compared to existing methods .
RAG over Tables: Hierarchical Memory Index, Multi-Stage Retrieval, and Benchmarking (2026.findings-acl)

Copied to clipboard

Challenge: Retrieval-Augmented Generation (RAG) integrates knowledge from tables with an external knowledge base to improve the answer relevance and accuracy.
Approach: They propose a table-corpora-aware RAG framework called T-RAG to integrate external knowledge into Large Language Models (LLMs) they then develop a multi-table question answering benchmark called MultiTableQA which spans 3 different task types, 57,193 tables, and 23,758 questions in total.
Outcome: The proposed framework achieves state-of-the-art accuracy, recall, and runtime performance, with improvements of up to 9.4%.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations