AI Coding Live News

Mosaic: Multi-Session Agentic Reinforcement Learning for Context Compaction and Subagent Forking

Standard agentic reinforcement learning assumes single-session trajectories with continuously accumulated context, clashing with production agent techniques like context compaction and subagent forking. Researchers introduce Mosaic (arXiv:2610.22174), a critic-free hierarchical optimization framework for Multi-Session Agentic RL. By incorporating session-usage signals at the trajectory level and shaping per-session advantages by marginal contribution, Mosaic outperforms trajectory-level broadcasting on BrowseComp across both compaction and subagent scenarios while using fewer sessions.

Mosaic: Multi-Session Agentic Reinforcement Learning for Context Compaction and Subagent Forking

Key Takeaways

  • Bridges single-session RL and multi-session inference: formalizes Multi-Session Agentic RL for context compaction and subagent forking workflows
  • Critic-free hierarchical advantage shaping: combines trajectory-level session-usage signals with session-level marginal contribution estimation
  • Higher accuracy with fewer sessions: outperforms trajectory-level broadcasting on BrowseComp across both compaction and subagent scenarios
Read full story

REMORY: HKUST and Alibaba Introduce Residual Memory for Agent Context Compaction, Matching Full Context with Only 5.2% Token Overhead

As autonomous agents execute complex multi-step workflows across terminal consoles and web browsers, context window expansion and escalating token costs impose severe operational bottlenecks. Conventional compaction methods rely on text summarization or token pruning, both of which discard crucial state variables and induce semantic drift over extended sessions. Researchers from HKUST and Alibaba present REMORY (arXiv:2610.11287), introducing a residual memory paradigm designed for sequence-level context compaction. REMORY combines lossy natural language summaries with bounded sets of learned soft memory tokens, effectively forming a residual connection in the sequence dimension. While text summaries convey high-level narrative continuity, the soft memory tokens reconstruct lost fine-grained execution artifacts, API arguments, and intermediate environment states. On challenging benchmarks including BrowseComp and Terminal-Bench 2.1, REMORY retains 97% of full-context task performance while occupying only 5.2% of the original input token footprint, slashing redundant tool retries and loops by more than 40%.

Key Takeaways

  • HKUST and Alibaba propose REMORY, establishing sequence-dimension residual memory connections to resolve agent context bloat
  • Matches 97.2% of full-context capability using only 5.2% of token positions, slashing repetitive tool errors by 41.5% on Terminal-Bench
  • Non-invasive plug-and-play architecture reduces TTFT latency by 73.8%, setting a new benchmark for long-horizon agent efficiency
Read full story
Linked Models & Agents:

TypeSafe co-founder shares coding-agent design notes: routing, compaction, subagents, skills, and MCP

@CompleteSkeptic (Diogo Almeida, TypeSafe; RLHF background) published public design notes on TypeSafe × coding agents (Google Doc), covering routing, context compaction, subagents, skills, and MCP tradeoffs, and invited the community to experiment. The post drew ~930 likes / ~56k views the same day.

Key Takeaways

  • Public Google Doc on coding-agent routing, compaction, subagents, skills, and MCP.
  • Authored by a TypeSafe principal; explicitly invites community experimentation.
  • Same-day high engagement (~930 likes / ~56k views) as a design reference.
Read full story
Linked Models & Agents:

fast-jev-compaction swaps Claude Code summarization for Jev decision-based compaction

@aiRobertDaily highlighted fast-jev-compaction, a Claude Code plugin that replaces traditional LLM summarization with Jev-driven, decision-based context compaction. It quickly filters tool calls and results, drops or truncates stale content, and keeps only the necessary parts of valuable text; a related Codex-facing Jev context server was also noted. The aim is lower token cost and faster delivery.

Key Takeaways

  • A Claude Code plugin replaces classic summarization with Jev decision-based compaction.
  • Filters tool-call results, drops or truncates stale context, and keeps necessary signal.
  • Targets lower token cost and faster delivery; a Codex-facing Jev path is also noted.
Read full story
Linked Models & Agents:
ADSponsored

Sourcegraph Cody introduces semantic context compaction preserving AST call chains across 200k token windows

Sourcegraph introduced a semantic context compaction engine for Cody. Designed for deep call-stack comprehension, the algorithm prunes boilerplate while strictly retaining function signatures, type contracts, and critical execution paths. This compresses token usage by 60% and increases multi-package code synthesis accuracy by 34%.

Key Takeaways

  • Prunes boilerplate while strictly preserving type contracts and critical AST paths.
  • Improves cross-package code completion and refactoring accuracy by 34%.
  • Rolled out across Cody VS Code, JetBrains IDE plugins, and Sourcegraph Enterprise.
Read full story