AIarXiv

Heuristic editor, no API keyVerdict: Routine

REMORY: Learning Residual Memory for Context Compaction

Long-horizon agents compact their history to continue within a finite context window, but a textual summary alone may not support every subsequent decision.

By Xia, Chen, Ge +5

Score█████░░░░░4.7

Key numbers

  • 5.2% of the input positions

Caveats

  • Preprint; not yet peer reviewed.

VerdictCompetent work. Briefs at most.

Read the originalPDFCode

Abstract

Long-horizon agents compact their history to continue within a finite context window, but a textual summary alone may not support every subsequent decision. We introduce REMORY, a neural memory network that supplements the summary with a bounded sequence of soft memory tokens. Given the history and summary, the network learns to generate tokens that help a frozen LLM approximate the continuation it would produce with the full history. The tokens are conditioned on the summary and appended after it, forming an analogue of a residual connection along the sequence dimension. On SummHay, REMORY improves source attribution at nearly unchanged insight coverage and approaches the full-context joint score using only 5.2% of the input positions. Across long-horizon agent benchmarks, Qwen3.8-27B and GLM-5.3-Flash show consistent gains with residual memory. Both models also exhibit substantially fewer repeated tool outputs and tool errors on BrowseComp and Terminal-Bench 2.1.

Hanchen Xia, Baoyou Chen, Yutang Ge, Naihao Deng, Senqiao Yang, Zilong Dong, Weihao Yuan, Siyu Zhu

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude██░░░ 218%Solid incremental gain on a meaningful problem.
Evidence██░░░ 214%Limited: single setting, weak baselines, or an observational association presented as causal.
Novelty██░░░ 216%A new combination of known ideas.
Trajectory██░░░ 218%Some room to improve with obvious engineering.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); stakes (general AI).

How the score was computed

rank-2026-10-07

Score█████░░░░░4.7

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Merit
3.7 / 10
Weighted rubric, evidence-gated.
Adjusted merit
3.9 / 10
Shrunk toward the desk prior by editor confidence (34%).
Attention
72%
Citations, upvotes, points, mentions.
Freshness
35%
Half-life decay since publication.
  • Citations0 (reference 15, via semantic-scholar, Oct 10, 2026, 02:05 UTC)
  • Influential citations0 (reference 3, via semantic-scholar, Oct 10, 2026, 02:05 UTC)
  • Hugging Face upvotes37 (reference 25, via hf-daily, Oct 11, 2026, 13:49 UTC)
  • GitHub stars38 (reference 250, via hf-daily, Oct 11, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v6 on Oct 11, 2026, 02:05 UTC. Paper type: method.
  • Categories: cs.CL, cs.AI
  • BRIEF, No.3 in the Artificial Intelligence edition of October 12, 2026.