Beyond Retrieval: Query-Conditioned Reuse of Long-Horizon Agent Trajectories

• URL: http://arxiv.org/abs/2608.12847v1
• Date: Thu, 13 Aug 2026 05:39:49 GMT
• Title: Beyond Retrieval: Query-Conditioned Reuse of Long-Horizon Agent Trajectories
• Abstract summary: Retrieval can identify a past trajectory that may matter, yet it does not specify how an acting agent should use that trajectory after users, entities, constraints, or environment state have changed.<n>We identify this post-retrieval reuse step as a distinct bottleneck for long-horizon trajectory memory.<n>We instantiate the framework with query-conditioned reuse (QCR), a deliberately simple target-bound note that records a reusable procedure.
• Score: 16.13133177152883
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Retrieval can identify a past trajectory that may matter, yet it does not specify how an acting agent should use that trajectory after users, entities, constraints, or environment state have changed. We identify this post-retrieval reuse step as a distinct bottleneck for long-horizon trajectory memory and formulate an evaluation framework that holds candidate retrieval, target state, model, decoding, and tool budget fixed while varying the support delivered to the agent. We instantiate the framework with query-conditioned reuse (QCR), a deliberately simple target-bound note that records a reusable procedure, bindings to recover, applicability conditions, and verification requirements. QCR serves to test the reuse hypothesis rather than to claim a universally preferred memory format. Across 2,391 target instances in WebArena, WorkArena, and AppWorld, QCR reaches 62.3% average Success, 10.7 points above Full Trajectory, while using 48.9% fewer online tokens. Summary reranking selects a reusable memory for 94.8% of targets, placing end-task Success within 1.8 points of an oracle reusable selector. Analyses by trajectory length and source--target binding shift show that direct trajectory injection loses much of its utility as traces grow longer or source-specific values change, whereas target-bound support preserves a larger share of the measured gain. The resulting framework separates retrieval quality from the problem of turning retrieved experience into safe, useful support for a new task.

Related papers

• TRIAGE: Three-level Routing and Intelligent Agent Guidance for Efficient Execution [0.0]
  TRIAGE is a three-level routing framework that reduces token consumption by reusing historical execution trajectories.<n>Its core innovation is Tjectory-as-a-Skill, which abstracts historical execution trajectories into reusable skills.<n>In large-scale experiments on 1,007 security monitoring queries, TRIAGE achieves 62.3% token savings.
  arXiv  Detail & Related papers  (2026-09-01T15:40:09Z)
• Cost-Effective Repository Exploration for Agentic Issue Localization [0.2715382584771446]
  We study whether this stage can be delegated to lower-cost models.<n>We measure early candidate discovery, top-three gold-file coverage, strict file-set recovery, agent time, and token usage.<n>Highest-quality explorer leads across localization metrics, but substantially cheaper operating points emerge.
  arXiv  Detail & Related papers  (2026-08-30T09:16:33Z)
• RecGPT-Mobile-V2 Technical Report [22.10290138930905]
  RecGPT-Mobile-V2 is an end-to-end framework that treats intent quality and execution efficiency as coupled objectives within a staged design.<n>The framework transforms heterogeneous interactions into an evidence-preserving trajectory, establishes a recommendation-native foundation through domain adaptation and supervised alignment.<n>Online retrieval analysis indicates that the Query recall channel retrieves inventory complementary to that surfaced by established recall channels.
  arXiv  Detail & Related papers  (2026-08-25T09:23:17Z)
• A-SR: Self-Evolving Agentic LLMs for Symbolic Regression via Hierarchical Coordination [51.06539604709775]
  We propose A-SR, a self-evolving agentic framework that shifts the control unit from expression edits to role-conditioned evidence views.<n>A-SR coordinates formula discovery through routing among coordination protocols, an online evaluator-reward role policy, and state-routed process memory.
  arXiv  Detail & Related papers  (2026-08-05T14:01:10Z)
• MemOps: Benchmarking Lifecycle Memory Operations in Long-Horizon Conversations [50.24315431387575]
  We introduce MemOps, a benchmark that reformulates conversational memory as a sequence of lifecycle operations.<n>MemOps represents each memory event with a structured trace specifying its trigger, target, scope, state transition, and supporting evidence.<n>Across long-context, retrieval-based, parametric and managed-memory systems, MemOps disentangles failure modes that final-answer accuracy alone conceals.
  arXiv  Detail & Related papers  (2026-07-14T15:33:44Z)
• Learning to Retrieve: Dual-Level Long-Term Memory for Text-to-SQL Agents [63.38073530162493]
  Long-term memory helps agents reuse past experiences.<n> Static methods rely on fixed similaritys that do not optimize downstream utility.<n>We propose MERIT, a dynamic multi-horizon memory retrieval framework.
  arXiv  Detail & Related papers  (2026-05-30T05:44:34Z)
• Same Ranking, Different Winner: How Scoring Targets Shape LLM Memory Benchmarks [2.9089118242427627]
  Conversational-memory systems transform dialogue history into facts, summaries, timelines, and other source-linked descendants.<n>This raises an underspecified evaluation question: which stored form should receive retrieval credit?<n>We show that this scoring-target choice is often left implicit and can materially change benchmark conclusions.
  arXiv  Detail & Related papers  (2026-05-22T02:53:07Z)
• MINTEval: Evaluating Memory under Multi-Target Interference in Long-Horizon Agent Systems [69.06764269022925]
  We study how current memory-augmented agents perform in realistic, interference-heavy, long-horizon settings.<n> MINTEval is a benchmark featuring long, highly interconnected contexts with frequently updated information.<n>Overall, MINTEval has 15.6k question-answering pairs over long-horizon contexts averaging 138.8k tokens and extending to 1.8M tokens per instance.
  arXiv  Detail & Related papers  (2026-05-18T15:43:35Z)
• Thinking Ahead: Prospection-Guided Retrieval of Memory with Language Models [10.094292900770261]
  Long-horizon personalization requires dialogue assistants to retrieve user-specific facts from extended interaction histories.<n>In practice, many relevant facts often have low semanticsimilarity to the query under dense retrieval.<n>We introduce Prospection-Guided Retrieval (PGR), which decouples retrieval from how memories are stored.
  arXiv  Detail & Related papers  (2026-05-13T22:57:54Z)
• From Unstructured Recall to Schema-Grounded Memory: Reliable AI Memory via Iterative, Schema-Aware Extraction [39.146761527401424]
  Persistent AI memory is often reduced to a retrieval problem.<n>This paper argues that reliable external AI memory must be schema-grounded harnesses.<n>We present an iterative, schema-aware write path that decomposes memory ingestion into object detection, field detection, and field-value extraction.
  arXiv  Detail & Related papers  (2026-04-30T14:14:02Z)
• R$^3$AG: Retriever Routing for Retrieval-Augmented Generation [59.47703698994575]
  R$3$AG decomposes retriever capability into two learnable dimensions: retrieval quality and generation utility.<n>R$3$AG consistently outperforms both the best individual retrievers and state-of-the-art static routing methods.
  arXiv  Detail & Related papers  (2026-04-22T06:51:20Z)
• Mem2ActBench: A Benchmark for Evaluating Long-Term Memory Utilization in Task-Oriented Autonomous Agents [20.357475946040054]
  We introduce textscMem2ActBench, a benchmark for evaluating whether agents can proactively leverage long-term memory to execute tool-based actions.<n>A reverse-generation method produces 400 tool-use tasks, with human evaluation confirming 91.3% are strongly memory-dependent.
  arXiv  Detail & Related papers  (2026-01-13T06:22:32Z)
• ReFIT: Relevance Feedback from a Reranker during Inference [109.33278799999582]
  Retrieve-and-rerank is a prevalent framework in neural information retrieval. We propose to leverage the reranker to improve recall by making it provide relevance feedback to the retriever at inference time.
  arXiv  Detail & Related papers  (2023-05-19T15:30:33Z)

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.