智能体
arxiv.org ·
@Taranjeet Singh
DolphinBench:刻画 agent 记忆的 Pareto 前沿
论文提出 DolphinBench,通过 agent 的任务完成情况直接评估记忆能力,而非依赖对话式问答(后者的问题本身已暗示需检索哪些事实)。基准包含三个知识工作 persona,每个约 50 万 token 用户消息,每个 persona 200 个任务,并通过带与不带相关历史的对照运行验证任务确实依赖该历史。评测还要求同时报告总成本与延迟,以映射记忆系统在准确率与开销之间的 Pareto 前沿。
AI推荐理由 arXiv 论文,提出 DolphinBench,直接以 agent 任务完成度评估记忆能力,而非对话式问答。基准包含三个知识工作 persona,每个约 50 万 token 用户消息,每个 persona 200 个任务,并通过带/不带相关历史的对照运行验证任务确实依赖该历史(有历史须成功、无历史须失败)。同时要求评测同时报告总成本与延迟,以刻画记忆系统的 Pareto 前沿。局限:摘要未给出各系统的实测排名与具体数值。
78
正文
Computer Science > Computation and Language
arXiv:2609.24971v1 (cs)
[Submitted on 21 Sep 2026]
Title:DolphinBench: Mapping the Pareto Frontier of Agent Memory
Authors:Soumil Rathi, Deshraj Yadav, Taranjeet Singh
View a PDF of the paper titled DolphinBench: Mapping the Pareto Frontier of Agent Memory, by Soumil Rathi and 2 other authors
View PDF
HTML (experimental)
Abstract:Agents today often take real-world actions that depend on long-term memory and context recall over time. However, most current memory benchmarks are built for a conversational question-answer format, where the question itself signals that some fact must be retrieved, and often which one. Moreover, benchmarks rarely require anything beyond accuracy from submissions, allowing memory systems to make unreasonable cost/time tradeoffs to achieve higher scores.
We present DolphinBench, a benchmark that evaluates memory directly through an agent's task completion. DolphinBench includes three knowledge-work personas with roughly 500k tokens of user messages per persona and evaluates agents on tasks that depend on information from that history. We verify all 200 tasks per persona by running an agent with and without the relevant history, requiring success with it and failure without it.
Finally, we require all evaluations to report total cost and latency alongside accuracy, which enables us to evaluate agent memory systems holistically. No existing memory benchmark combines all three. The dataset and evaluation code are available at this https URL.
Comments:
Subjects:
Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
Cite as:
arXiv:2609.24971 [cs.CL]
(or
arXiv:2609.24971v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.24971
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Soumil Rathi [view email]
[v1]
Mon, 21 Sep 2026 17:54:35 UTC (15 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled DolphinBench: Mapping the Pareto Frontier of Agent Memory, by Soumil Rathi and 2 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.CL
new
|
recent
| 2026-09
Change to browse by:
cs
cs.AI
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
export BibTeX citation
Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? |
Disable MathJax (What is MathJax?)