Pith. sign in

REVIEW 29 cited by

MemoRAG: Boosting Long Context Processing with Global Memory-Enhanced Retrieval Augmentation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.05591 v3 pith:6ZGDMFRN submitted 2024-09-09 cs.CL cs.AI

MemoRAG: Boosting Long Context Processing with Global Memory-Enhanced Retrieval Augmentation

classification cs.CL cs.AI
keywords longmemoragcontextglobalprocessingretrievalcontextsexpensive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Processing long contexts presents a significant challenge for large language models (LLMs). While recent advancements allow LLMs to handle much longer contexts than before (e.g., 32K or 128K tokens), it is computationally expensive and can still be insufficient for many applications. Retrieval-Augmented Generation (RAG) is considered a promising strategy to address this problem. However, conventional RAG methods face inherent limitations because of two underlying requirements: 1) explicitly stated queries, and 2) well-structured knowledge. These conditions, however, do not hold in general long-context processing tasks. In this work, we propose MemoRAG, a novel RAG framework empowered by global memory-augmented retrieval. MemoRAG features a dual-system architecture. First, it employs a light but long-range system to create a global memory of the long context. Once a task is presented, it generates draft answers, providing useful clues for the retrieval tools to locate relevant information within the long context. Second, it leverages an expensive but expressive system, which generates the final answer based on the retrieved information. Building upon this fundamental framework, we realize the memory module in the form of KV compression, and reinforce its memorization and cluing capacity from the Generation quality's Feedback (a.k.a. RLGF). In our experiments, MemoRAG achieves superior performances across a variety of long-context evaluation tasks, not only complex scenarios where traditional RAG methods struggle, but also simpler ones where RAG is typically applied.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 29 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts

    cs.CR 2026-05 unverdicted novelty 8.0

    ShadowMerge poisons graph-based agent memory by creating relation-channel conflicts that get extracted and retrieved, achieving 93.8% attack success rate on Mem0 and datasets like PubMedQA while evading prior defenses.

  2. ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts

    cs.CR 2026-05 unverdicted novelty 8.0

    ShadowMerge exploits relation-channel conflicts to poison graph-based agent memory, achieving 93.8% average attack success rate on Mem0 and real-world datasets while bypassing existing defenses.

  3. ShadowMerge: A Novel Poisoning Attack on Graph-Based Agent Memory via Relation-Channel Conflicts

    cs.CR 2026-05 unverdicted novelty 8.0

    ShadowMerge poisons graph-based agent memory via relation-channel conflicts using an AIR pipeline, achieving 93.8% average attack success rate on Mem0 and three real-world datasets while bypassing existing defenses.

  4. SCOUT: Active Information Foraging for Long-Text Understanding with Decoupled Epistemic States

    cs.CL 2026-05 unverdicted novelty 7.0

    SCOUT achieves state-of-the-art long-text understanding with up to 8x lower token use by actively foraging for sparse query-relevant information and updating a compact provenance-grounded epistemic state.

  5. Learning How and What to Memorize: Cognition-Inspired Two-Stage Optimization for Evolving Memory

    cs.CL 2026-05 unverdicted novelty 7.0

    MemCoE learns memory organization guidelines via contrastive feedback and then trains a guideline-aligned RL policy for memory updates, yielding consistent gains on personalization benchmarks.

  6. Structure Guided Retrieval-Augmented Generation for Factual Queries

    cs.IR 2026-04 unverdicted novelty 7.0

    SG-RAG frames retrieval as subgraph matching to ensure LLMs meet every condition in factual queries and reports large gains over baselines on a new 120k-pair ERQA dataset.

  7. DOTRAG: Retrieval-Time Reasoning Along Paths

    cs.IR 2026-04 unverdicted novelty 7.0

    DotRAG reformulates graph retrieval as query-guided path reasoning with Division of Thought, reporting SOTA results on MetaQA and UltraDomain for multi-hop tasks.

  8. PERMA: Benchmarking Personalized Memory Agents via Event-Driven Preference and Realistic Task Environments

    cs.AI 2026-03 unverdicted novelty 7.0

    PERMA is a new benchmark using temporally ordered events, text variability, and linguistic alignment to evaluate LLM memory agents on persona consistency beyond simple retrieval.

  9. AtomicRAG: Atom-Entity Graphs for Retrieval-Augmented Generation

    cs.IR 2026-02 unverdicted novelty 7.0

    AtomicRAG replaces chunk-based and triple-based GraphRAG with atom-entity graphs that store facts as atomic units and use personalized PageRank plus relevance filtering to achieve higher retrieval accuracy and reasoni...

  10. MemSIF: From Structured Interactions to Dual-Track Fact Memory for LLM Agents

    cs.AI 2026-08 conditional novelty 6.0

    MemSIF improves long-term LLM agent memory by combining structured interaction organization with dual-track fact memory, reporting top Total ACC on LoCoMo and LongMemEval-S across five backbones.

  11. Agents-K1: Towards Agent-native Knowledge Orchestration

    cs.AI 2026-06 unverdicted novelty 6.0

    Agents-K1 is an end-to-end pipeline with a multimodal parser, 4B GRPO-trained extractor, and agent CLI that builds scientific knowledge graphs from full papers and was run on 2.46 million documents to produce Scholar-KG.

  12. MemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation

    cs.IR 2026-05 unverdicted novelty 6.0

    MemGraphRAG uses a memory-based multi-agent system for globally consistent graph construction from fragmented corpora plus a memory-aware hierarchical retriever, claiming better benchmark performance than prior GraphR...

  13. Mem-$\pi$: Adaptive Memory through Learning When and What to Generate

    cs.CL 2026-05 unverdicted novelty 6.0

    Mem-π is a framework using a dedicated model and decision-content decoupled RL to generate context-specific guidance on demand for LLM agents, outperforming retrieval baselines by over 30% on web navigation.

  14. Evolve: A Persistent Knowledge Lifecycle for Small Language Models

    cs.LG 2026-04 unverdicted novelty 6.0

    A 2B model using Evolve reaches 60-84% accuracy on 750 queries across specialist questions, NaturalQuestions, and TriviaQA (up from 20-33%) while cutting teacher invocations by over 50% via a consolidated section-base...

  15. FlexStructRAG: Flexible Structure-Aware Multi-Granular Relational Retrieval for RAG

    cs.IR 2026-02 unverdicted novelty 6.0

    FlexStructRAG jointly constructs knowledge graphs, hypergraphs, and semantic clusters with dynamic partitioning to enable query-adaptive multi-granular retrieval that improves semantic scores over standard RAG baselin...

  16. VulRTex: A Reasoning-Guided Approach to Identify Vulnerabilities from Rich-Text Issue Report

    cs.SE 2025-09 conditional novelty 6.0

    A retrieval-augmented LLM approach that identifies vulnerability-related issue reports and CWE types from screenshots and code snippets, improving F1 by 11 points and AUPRC by 20 points over baselines.

  17. In-depth Analysis of Graph-based RAG in a Unified Framework

    cs.IR 2025-03 unverdicted novelty 6.0

    A unified framework and large-scale comparison of graph-based RAG methods on QA tasks yields new high-performing variants obtained by recombining existing components.

  18. ConMem: Contribution-Aware Memory for Long-Horizon Manufacturing Inspection Logs

    cs.AI 2026-07 conditional novelty 5.5

    Role-segmented inspection memories ranked by approximated Shapley contribution yield 76% early-risk QA accuracy with ~88% fewer tokens than naive 8K-context LLMs.

  19. Agents-K1: Towards Agent-native Knowledge Orchestration

    cs.AI 2026-06 conditional novelty 5.0

    A full-paper multimodal knowledge-graph pipeline with a GRPO-trained 4B extractor and tri-source agent CLI reports improved multi-hop scientific reasoning, alongside a released one-million-paper knowledge graph.

  20. Agents-K1: Towards Agent-native Knowledge Orchestration

    cs.AI 2026-06 unverdicted novelty 5.0

    Agents-K1 builds agent-native scientific knowledge graphs from full papers via a multimodal parser, 4B GRPO-trained extractor, and tri-source graph interface, applied to 2.46M papers yielding Scholar-KG.

  21. Exploring Cross-Scenario Generality of Agentic Memory Systems: Diagnostics and a Strong Baseline

    cs.AI 2026-06 unverdicted novelty 5.0

    An agentic harness letting the LLM self-manage flat text-file storage via tool calls outperforms eight prior memory systems on cross-scenario generality across QA, chat, trajectory, stress-test, and long-horizon tasks.

  22. MegaRAG: Multimodal Knowledge Graph-Based Retrieval Augmented Generation

    cs.AI 2025-11 unverdicted novelty 5.0

    MegaRAG introduces a multimodal knowledge graph-based RAG system that incorporates visual cues into graph construction, retrieval, and generation to improve question answering on complex textual and multimodal corpora.

  23. GOSU: Retrieval-Augmented Generation with Global-Level Optimized Semantic Unit-Centric Framework

    cs.CL 2025-08 reject novelty 5.0

    GOSU globally merges semantic units from text chunks into a unit-centric knowledge graph and uses three-tier keyword retrieval to improve RAG generation quality, according to LLM-judge win rates.

  24. Personalizing Student-Agent Interactions Using Log-Contextualized Retrieval-Augmented Generation (RAG)

    cs.CL 2025-05 unverdicted novelty 5.0

    LC-RAG augments standard RAG by incorporating environment logs to contextualize student discourse, yielding better retrieval and more relevant guidance from the Copa agent in the C2STEM modeling environment.

  25. From Human Memory to AI Memory: A Survey on Memory Mechanisms in the Era of LLMs

    cs.IR 2025-04 unverdicted novelty 5.0

    The paper surveys human memory categories, maps them to LLM memory, and proposes a new three-dimension (object, form, time) categorization into eight quadrants to organize existing work and highlight open problems.

  26. The Periodic Table of LLM Reasoning: A Structured Survey of Reasoning Paradigms, Methods, and Failure Modes

    cs.CL 2026-06 unverdicted novelty 4.0

    A literature survey that introduces a taxonomy for LLM reasoning paradigms, analyzes methodological trends, and synthesizes failure modes from over 300 papers.

  27. LightRAG: Simple and Fast Retrieval-Augmented Generation

    cs.IR 2024-10 unverdicted novelty 4.0

    LightRAG builds graph structures into RAG indexing and retrieval with dual-level search and incremental updates to improve accuracy and speed.

  28. MODE-RAG: Manifold Outlier Diagnosis and Energy-based Retrieval-Augmented Generation Evaluation

    cs.CL 2026-06 unverdicted novelty 3.0

    MODE-RAG introduces a VFE-driven multi-agent pipeline with MCTS and logit perturbations to lower hallucination and sycophancy rates in multimodal RAG, tested on the new ModeVent subset of MultiVent.

  29. Toward Efficient Agents: Memory, Tool learning, and Planning

    cs.AI 2026-01 conditional novelty 3.0

    A survey that organizes efficiency techniques for LLM agents into memory, tool learning, and planning, and consolidates benchmarks and metrics for measuring cost-performance trade-offs.