跳到正文
Jones Ray

ScholarPulse 日报 2026-09-24

2026-09-24 学术简报:2 篇。FRESH 将工具智能体的成功与失败组织为异构图记忆,帮助冻结小/中语言模型在长程有状态任务中复用策略并减少重复失败。

今日速览

序号标题来源日期主题推荐等级
1Learning from Failures: Heterogeneous Graph Memory for Small Language Model Tool-Using AgentsarXiv2026-09-23AI-Agent高
2The KV Cache Working Set: Online Capacity Planning for LLM Inference SystemsarXiv2026-09-23AI-Agent高

重点论文与技术动态

1. Learning from Failures: Heterogeneous Graph Memory for Small Language Model Tool-Using Agents

一句话结论

FRESH 将工具智能体的成功与失败组织为异构图记忆,帮助冻结小/中语言模型在长程有状态任务中复用策略并减少重复失败。

核心内容

方法与数据

价值判断

摘要 Small and medium-sized language models offer cost-effective executors for tool-using agents, making them attractive for local and large-scale deployment. However, in long-horizon and stateful environments, they often make structural errors such as missing required observations, performing premature writes, repeating failed calls, and violating action preconditions. These errors can lead to incorrect state updates, policy violations, and costly or irreversible consequences, making reliable tool execution a critical deployment challenge. Existing fine-tuning approaches require substantial data and computation, while flat memory may retrieve failed actions without preserving their causal context or safety conditions. In this paper, we propose FRESH, a Failure-aware Retrieval framework over Experience-Structured Heterogeneous graphs, which transforms historical successes and failures into structured external experience for tool-using agents. By explicitly modeling the dependencies among tasks, actions, errors, repairs, and execution conditions, FRESH helps frozen language models reuse reliable strategies, avoid recurring failures, and make safer decisions in stateful tool interactions. Experiments on $τ$-Bench and AppWorld with multiple open-source models show that FRESH consistently improves task success and tool-use reliability over no-memory agents and representative memory-based baselines.

2. The KV Cache Working Set: Online Capacity Planning for LLM Inference Systems

一句话结论

KVSET 是面向 LLM 推理的在线分析器,可估计达到目标 KV 缓存命中率所需的最小容量,辅助容量规划。

核心内容

方法与数据

价值判断

摘要 Prefix caching is critical for efficient large language model (LLM) serving, particularly for agentic workloads that repeatedly invoke the model with a growing conversation and tool-use history. By reusing the key-value (KV) states of previously processed prefixes, prefix caching avoids redundant prefill computation. Its effectiveness, however, depends on retaining a sufficiently large set of KV cache states. Provisioning enough cache to preserve all historical KV states is prohibitively expensive and often unnecessary, whereas insufficient capacity can substantially degrade the cache hit rate. Determining the KV cache working set, defined as the minimum cache capacity required to achieve a target hit rate, is therefore essential for efficient cache provisioning and system design. We present KVSET, an online analyzer that estimates the KV cache working set of LLM serving workloads. KVSET uses the Mattson stack algorithm to efficiently estimate cache hit rates across a wide range of cache capacities. For each KV cache page, KVSET computes its LRU stack distance and compares it with the page number of each candidate capacity. This comparison determines whether the page would be a hit at each capacity without independently simulating every capacity configuration. KVSET therefore substantially reduces the computational and memory overhead of conventional capacity-by-capacity simulation and makes online working-set analysis practical. KVSET further determines the minimum cache capacity based on the maximum LRU depth among the prefix pages required to achieve the target hit rate. We validate KVSET using traces collected from production LLM workloads and show that its estimates closely match measurements from real cache deployments. The open-source implementation supports both online request processing and offline trace replay.