PACMS: Submodular Context Selection as a Pluggable Engine for LLM Agents

• URL: http://arxiv.org/abs/2606.20047v1
• Date: Thu, 18 Jun 2026 10:22:57 GMT
• Title: PACMS: Submodular Context Selection as a Pluggable Engine for LLM Agents
• Abstract summary: LLM agents operate over a context window that fills from several directions simultaneously.<n>The prevailing mechanism is recency truncation, sometimes paired with periodic summarization.<n>Retrieval augmented generation fetches external documents into the prompt but does not arbitrate the agent's emphalready-present pooled context.
• Score: 0.9134244356393664
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Conversational and tool-using LLM agents operate over a context window that fills from several directions simultaneously. As a session proceeds, the agent accumulates user and assistant turns, entries drawn from a persistent memory store, and often largest of all, the verbatim outputs of tool calls such as file reads, search results, and API responses. Once the cumulative context exceeds the model's token budget, the framework must decide what to keep. The prevailing mechanism is recency truncation, sometimes paired with periodic summarization. This is topic-blind: a fact established early in a session is discarded simply because it is old, even when the current user query is about exactly that fact; conversely, verbose but irrelevant recent material is retained. Agents that must recall information across many turns, the defining case for memory, are precisely where recency truncation fails. Existing alternatives sit outside the agent's assembly step. Retrieval augmented generation fetches external documents into the prompt but does not arbitrate the agent's \emph{already-present} pooled context. Context-compression methods reduce token count by rewriting or pruning text, but operate query-blind and lossily. Neither treats memory entries, conversation turns, and tool outputs as a single candidate pool to be selected from by relevance at the moment the prompt is assembled.

Related papers

• Context as an Environment: Programmatic Context Management for Long-Horizon Agents [47.21335299084925]
  We present Scroll, a context manager that treats each agent session as an executable Session Environment.<n>The kernel maintains a typed across model calls, allowing tool outputs, retrieved history, and derived state to be bound to variables.
  arXiv  Detail & Related papers  (2026-08-21T23:39:19Z)
• Zero-Mem: Zero-Token Memory Operations for LLM Agents [17.228305588778]
  Zero-Mem preserves original interaction traces as its source of record.<n>Zero-Mem achieves competitive performance across long-memory and long-context question-answering benchmarks.
  arXiv  Detail & Related papers  (2026-07-31T13:01:06Z)
• LazyMem: Retrieve Broadly, Construct Selectively for Efficient Long-Term Agent Memory [10.916121108457537]
  We introduce LazyMem, which deferring all memory construction to query time.<n>On LongMemEval, LazyMem-4B achieves an LLM-judge accuracy of 0.85, outperforming the strongest non-oracle baseline.<n>It further generalizes to LoCoMo without target-domain training and reduces mean latency relative to the prior query-time baseline.
  arXiv  Detail & Related papers  (2026-07-17T12:49:57Z)
• OpenRath: Session-Centered Runtime State for Agent Systems [2.9568259440852]
  OpenRath is a PyTorch-like programming model for multi-agent, multi-session systems.<n>Session is branchable, inspectable, replayable, backend-aware, and composable.<n>Report presents the programming model, architecture, audited milestones, and evidence protocol.
  arXiv  Detail & Related papers  (2026-06-17T15:19:19Z)
• Scaling Self-Evolving Agents via Parametric Memory [69.96398842169002]
  Existing memory-augmented LLM agents store past experience exclusively in prompt space.<n>We introduce textttTMEM, a self-evolving parametric memory framework.<n>textttTMEM consistently outperforms summary-based and retrieval-based baselines across different model scales.
  arXiv  Detail & Related papers  (2026-06-03T07:18:31Z)
• GenericAgent: A Token-Efficient Self-Evolving LLM Agent via Contextual Information Density Maximization (V1.0) [56.81743709880371]
  Long-horizon large language model (LLM) agents are fundamentally limited by context.<n>We argue that long-horizon performance is determined not by context length, but by how much decision-relevant information is maintained within a finite context budget.<n>We present GenericAgent (GA), a general-purpose, self-evolving LLM agent system built around a single principle: information density and context.
  arXiv  Detail & Related papers  (2026-04-18T17:59:15Z)
• Beyond RAG for Agent Memory: Retrieval by Decoupling and Aggregation [22.803751188961865]
  We argue retrieval should move beyond similarity matching and instead operate over latent components.<n>We propose xMemory, which builds a hierarchy of intact units and maintains a searchable high-level node organisation.
  arXiv  Detail & Related papers  (2026-02-02T12:04:58Z)
• A Simple Yet Strong Baseline for Long-Term Conversational Memory of LLM Agents [4.706565675142042]
  LLM-based conversational agents still struggle to maintain coherent, personalized interaction over many sessions.<n>Motivated by neo-Davidsonian event semantics, we propose an event-centric alternative that represents conversational history as short, event-like propositions.<n>Our design aims to preserve information in a non-compressive form and make it more accessible, rather than more lossy.
  arXiv  Detail & Related papers  (2025-11-21T12:41:17Z)
• COSMIR: Chain Orchestrated Structured Memory for Iterative Reasoning over Long Context [12.538401452822098]
  We introduce COSMIR, a chain-style framework that replaces ad hoc messages with a structured memory.<n>Agents process chunks via a fixed micro-cycle: Extract, Infer, Refine, writing all updates to the shared memory.<n>A Manager agent then Synthesizes the final answer directly from the memory.
  arXiv  Detail & Related papers  (2025-10-06T08:10:04Z)
• From Single to Multi-Granularity: Toward Long-Term Memory Association and Selection of Conversational Agents [79.87304940020256]
  Large Language Models (LLMs) have been widely adopted in conversational agents.<n>MemGAS is a framework that enhances memory consolidation by constructing multi-granularity association, adaptive selection, and retrieval.<n> Experiments on four long-term memory benchmarks demonstrate that MemGAS outperforms state-of-the-art methods on both question answer and retrieval tasks.
  arXiv  Detail & Related papers  (2025-05-26T06:13:07Z)
• Walking Down the Memory Maze: Beyond Context Limit through Interactive Reading [63.93888816206071]
  We introduce MemWalker, a method that processes the long context into a tree of summary nodes. Upon receiving a query, the model navigates this tree in search of relevant information, and responds once it gathers sufficient information. We show that, beyond effective reading, MemWalker enhances explainability by highlighting the reasoning steps as it interactively reads the text; pinpointing the relevant text segments related to the query.
  arXiv  Detail & Related papers  (2023-10-08T06:18:14Z)
• Phrase Retrieval for Open-Domain Conversational Question Answering with Conversational Dependency Modeling via Contrastive Learning [54.55643652781891]
  Open-Domain Conversational Question Answering (ODConvQA) aims at answering questions through a multi-turn conversation. We propose a method to directly predict answers with a phrase retrieval scheme for a sequence of words.
  arXiv  Detail & Related papers  (2023-06-07T09:46:38Z)
• Query Resolution for Conversational Search with Limited Supervision [63.131221660019776]
  We propose QuReTeC (Query Resolution by Term Classification), a neural query resolution model based on bidirectional transformers. We show that QuReTeC outperforms state-of-the-art models, and furthermore, that our distant supervision method can be used to substantially reduce the amount of human-curated data required to train QuReTeC.
  arXiv  Detail & Related papers  (2020-05-24T11:37:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.