Skip to content

PARSER: Read in Parallel, Reason in Depth for Long-Context LLM Agents

Sep 2026 · 0 citations · 47 references
Computer Science

TL;DR

PARSER, which decouples reading from reasoning, is introduced, which is robust to perturbations in evidence position, order, and distance, conditions that cause large accuracy swings in sequential methods, while reducing inference latency by up to 11x.

Abstract

Sequential memory agents process long documents by reading chunks one after another while maintaining a compact memory state, coupling document traversal to reasoning depth. This coupling introduces sensitivity to evidence placement and ties inference latency linearly to document length. We introduce PARSER, which decouples reading from reasoning. A bank of lightweight subagents each bound to a single chunk read the entire document in parallel, while a lead agent reasons in depth through iterative scatter--gather rounds: at each round it broadcasts a query to all subagents, aggregates the returned evidence, and formulates a deeper follow-up query conditioned on what has been found so far. This decoupled design concentrates all learnable behavior in the lead agent, which is optimized with reinforcement learning, while the subagents remain frozen off-the-shelf models. On multi-hop QA with contexts ranging from 7K to 896K tokens, PARSER with a 4B backbone outperforms the strongest sequential memory baseline by 5.7 points on average and by 12.0 points at 896K tokens. Scaling to a 9B backbone, PARSER surpasses DeepSeek-V4-Pro by 6.3 points. Controlled experiments confirm that PARSER is robust to perturbations in evidence position, order, and distance, conditions that cause large accuracy swings in sequential methods, while reducing inference latency by up to 11x.

View source

Similar papers

Preprint Aug 2026

PI-Mem: Pushing Long-Context Reasoning to 3.6M Tokens with Parallel-Iterative Memory

It is demonstrated that PI-Mem breaks the accuracy--efficiency trade-off in long-context reasoning and provides a scalable approach to complex multi-hop question answering over extremely long documents.

Da-Wei Liu, Haixu Song, Shuang Cheng et al. · 0 citations
#artificial intelligence Preprint Sep 2026

LAM: Efficient Lossy Agent Memory Framework With A Retrieval-Score Error Bound

Agent memory grows as agents read inputs, reason, and call tools. Longer histories increase inference cost and eventually exceed the context window. LLM-based summarization reduces this history but adds latency and provides no explicit bound on information loss. We propose LAM, a Lossy Agent Memory system with three co...

Bai-Xi Sun, Le Chen, Anjir Ahmed Chowdhury et al. · 0 citations
Preprint Aug 2026

Muscle Memory for Agents: Compile not Merely Retrieve

This paper argues that Muscle Memory - the practice of compiling recurring user intent into purpose-built specialist agents - is a distinct memory paradigm from retrieval, and argues that compilation is a better fit for the workloads where current assistants impose a multi-turn tax on their users.

Pouya Ghiasnezhad Omran, Soujanya Lanka, Qin Zhang et al. · 0 citations
Preprint Aug 2026

Weighted Memory Tree: Remembering What Matters for Long-Horizon LLM Agents

The results suggest that effective long-horizon agent memory depends less on storing more information than on deciding which information should remain active, and that effective long-horizon agent memory depends less on storing more information than on deciding which information should remain active.

Q. Dao, Purvi Kathalkar, Kenneth Eaton · 1 citation
Preprint Aug 2026

Chained Recursive Language Models for Multi-Iteration Reasoning

This work proposes Chained Recursive Language Models (Chained RLM), an inference-time architecture, in which the same underlying model is called repeatedly as a sequence of fresh reasoning roots, and studies when fresh-context artifact continuation gives a measurable gain in accuracy over direct LLM answering even with...

Purbesh Mitra, S. Ulukus · 0 citations
#machine learning Preprint Sep 2026

MemoryWalker: Stop Training Agents on Contexts They Never Saw

This work introduces two exact, gradient-equivalent corrections: LogitTree, a segmented K-forward traversal, and a packed 4D attention mask, and proposes SDCC (Self-Distillation for Conditioning Consistency), a single-backward-pass variational relaxation.

J. Zinco, Xun-Jie Zhu, Shen Huang et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.