Challenge: Existing methods rely on lexical or token-level features that fragment semantic units and fail to capture conceptually essential content.
Approach: They propose an unsupervised framework leveraging Abstract Meaning Representation to preserve essential information while filtering irrelevant text.
Outcome: The proposed framework outperforms RAG and existing baselines while preserving essential information while filtering irrelevant text.

Similar Papers

Pretraining Context Compressor for Large Language Models with Embedding-Based Memory (2025.acl-long)

Copied to clipboard

Challenge: Efficient processing of long contexts in large language models is essential for real-world applications such as retrieval-augmented generation and in-context learning.
Approach: They propose a decoupled compressor-LLM framework that preserves contextual information within condensed embedding representations.
Outcome: The proposed framework outperforms baseline models in three domains and across eight datasets while adapting to different downstream LLMs.
AMR-RE: Abstract Meaning Representations for Retrieval-Based In-Context Learning in Relation Extraction (2025.naacl-srw)

Copied to clipboard

Challenge: Existing in-context learning methods for relation extraction often overlook entity relationships . Existing methods for RE prioritize language similarity over structural similarity .
Approach: They propose an AMR-enhanced retrieval-based ICL method for relation extraction . their method retrieves in-context examples based on semantic structure similarity .
Outcome: The proposed method outperforms baselines on four English RE datasets and in the more demanding unsupervised setting.
Efficient Long Context Language Model Retrieval with Compression (2025.acl-long)

Copied to clipboard

Challenge: Long Context Language Models (LCLMs) are a new paradigm for Information Retrieval . however, processing large number of passages within in-context for retrieval is computationally expensive . a proposed compression approach for LCLM retrieval maximizes retrieval performance while minimizing the length of the compressed passages.
Approach: They propose a new compression approach tailored to maximize retrieval performance while minimizing the length of compressed passages.
Outcome: The proposed approach maximizes retrieval performance while minimizing the length of compressed passages while reducing the in-context size by 1.91.
Concise and Precise Context Compression for Tool-Using Language Models (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods suffer from key information loss and difficulty in adjusting the length of compressed sequences based on documentation lengths.
Approach: They propose two strategies for compressing tool documentation into concise and precise summary sequences for tool-using language models.
Outcome: The proposed approach achieves comparable performance to the upper-bound baseline under 16x compression ratio.
SARA: Selective and Adaptive Retrieval-augmented Generation with Context Compression (2026.acl-long)

Copied to clipboard

Challenge: Retrieval-augmented generation (RAG) extends large language models with external knowledge, but it must balance limited effective context, redundant retrieved evidence, and the loss of fine-grained facts.
Approach: They propose a hybrid RAG framework that uses natural-language snippets and semantic compression vectors to preserve passages in text form and compress remaining evidence into interpretable vectors for iterative evidence reranking.
Outcome: The proposed framework improves answer relevance, answer correctness and semantic similarity across 9 datasets and 5 open-source LLMs.
AttnComp: Attention-Guided Adaptive Context Compression for Retrieval-Augmented Generation (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for augmented large language models suffer from irrelevant retrieved content . existing methods struggle to adapt compression rates for different context, maintain low latency .
Approach: We propose an adaptive, efficient and context-aware compression framework to reduce retrieved content . AttnComp uses a top-p compression algorithm to retain the minimal set of documents whose attention weights exceed a threshold.
Outcome: Experiments show that AttnComp outperforms existing compression methods and uncompressed baselines in achieving higher accuracy with substantial compression rates and lower latency.
UNComp: Can Matrix Entropy Uncover Sparsity? — A Compressor Design from an Uncertainty-Aware Perspective (2025.emnlp-main)

Copied to clipboard

Challenge: Deploying large language models (LLMs) for long-context inference remains challenging due to their substantial memory and computational demands.
Approach: They propose an uncertainty-aware framework that leverages truncated matrix entropy to identify areas of low information content.
Outcome: The proposed framework reduces the KV cache size to 4.74% of the original and achieves a 6% speedup.
AMR Parsing with Latent Structural Information (2020.acl-main)

Copied to clipboard

Challenge: Abstract Meaning Representations (AMRs) capture sentence-level semantics structural representations to broad-coverage natural sentences.
Approach: They investigate parsing AMR with explicit dependency structures and interpretable latent structures.
Outcome: The proposed model achieves best results on both AMR 2.0 and AMR 1.0 . the proposed model has been adopted in downstream NLP tasks, including text summarization and question answering.
Factorising AMR generation through syntax (N19-1)

Copied to clipboard

Challenge: Abstract Meaning Representation (AMR) is a semantic annotation framework which abstracts away from the surface form of text to capture the core 'who did what to whom' structure.
Approach: They propose to decompose the generation process into two steps: first generate a syntactic structure, and then generate the surface form.
Outcome: The proposed approach generates meaning-preserving syntactic paraphrases of the same graph, as judged by humans.
Enhancing RAG Efficiency with Adaptive Context Compression (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods apply fixed compression rates, over-compressing simple queries or under-compressed complex ones.
Approach: a new framework uses a hierarchical compressor and a context selector to optimize inference efficiency . a framework that dynamically adjusts compression rates based on input complexity optimizes inference without loss of accuracy.
Outcome: Adaptive Context Compression for RAG outperforms fixed-rate methods on Wikipedia and five QA datasets .

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