arXiv 2606.29823v1Jun 29, 2026

Experience Graphs: The Data Foundation for Self-Improving Agents

Gang Liao et al.

Brief context

Publication timing, weekly edition context, and source links for this brief.

Published

Jun 29, 2026, 6:02 AM

Current score

74

Original paper

The executive brief below is grounded in the source paper and linked back to the arXiv abstract.

The database community has repeatedly advanced the state of the art by recognizing that new workloads demand new system architectures. We argue that long-horizon agentic tasks -- code generation, scientific discovery, hardware design -- are such a workload. These agents explore: they generate artifacts, execute tools, observe failures, branch, and repair over hundreds of steps. This search produces a structured object we call an experience graph: executable artifacts, tool outputs, rewards, sibling comparisons, and causal lineage. Yet existing agent frameworks treat this experience as disposable state -- JSON checkpoints and session logs that cannot be recovered after a crash, queried across users, or materialized into training data. We propose Trellis: a data foundation that treats the experience graph as first-class, governed, queryable database state. The core insight is that search over experience graphs is a database access pattern. Frontier selection is a query, cross-session reuse is vector-seeded graph retrieval, training-data extraction is a materialized view, and reconstructing what an agent knew at any past step is a time-travel query. When the database owns the experience graph, agents become stateless compute, and crash recovery, horizontal scaling, and a closed-loop training flywheel emerge as architectural byproducts. We ground the design in KernelEvolve, a production accelerator-kernel optimizer at Meta, where cross-session reuse reaches a target speedup roughly 10x faster at 52% lower token cost. More broadly, Trellis turns inference-time search from disposable computation into a durable institutional asset: logs made databases reliable; experience graphs may make agents cumulative.

Score 74Full-paper briefagentsdatainfratraining

Executive brief

A short business-reader brief that explains why the paper matters now and what to watch or do next.

Why this is worth your attention

Long-horizon agents are currently throwing away one of their most valuable byproducts: the structured record of what they tried, why it failed, and what worked. This paper argues that making that record a governed, queryable database can turn agent runs from disposable compute into reusable institutional memory, with early production evidence from Meta’s kernel-optimization work showing faster convergence and lower token cost. The evidence is strongest for a narrow coding-and-optimization setting, but the implication is broad: agent platforms may compete less on bigger prompts and more on how well they store, retrieve, audit, and learn from experience.

  • If the paper is right, the winning agent stack will not just run prompts and tools; it will preserve every attempt, failure, reward, branch, and repair as queryable company memory. That changes the economics of long-running agents because failed runs become reusable search capital rather than sunk token spend.
  • The strongest evidence is from Meta’s KernelEvolve: cross-session memory reduced buggy work and reached a target speedup roughly 10× faster, with 52% fewer tokens per valid node. For buyers and operators, the practical signal is whether persistent agent memory cuts retries, restarts, and duplicated exploration in a real workflow.
  • A serious agent platform should be able to explain whether prior attempts are durable, searchable across sessions, recoverable after crashes, auditable as-of a past step, and convertible into training data. If the answer is still session logs, JSON checkpoints, or a vector store bolted on the side, the platform may not accumulate advantage from use.
  • This paper reframes agent improvement as a data-infrastructure problem: one governed system has to support low-latency search, graph traversal, vector retrieval, time travel, and training extraction. That creates room for new platform competition below the agent UI and above conventional databases.
  • Reuse has a downside: too much memory made the search more conservative and missed the best observed solution in the reported study. The open management question is how to tune reuse so agents avoid known dead ends without converging prematurely on yesterday’s answer.

Evidence ledger

The strongest claims in the brief, along with the confidence and citation depth behind them.

stackhighp.1

Treating agent experience as durable database state can make agent workers stateless and improve crash recovery, scaling, and training-data reuse.

capabilityhighp.8p.8

In KernelEvolve, cross-session memory reduced buggy nodes, accelerated convergence, and lowered token cost per valid node.

traininghighp.7

Trellis proposes producing training data from materialized views over the operational agent store rather than scraping logs after the fact.

caveathighp.8

Cross-session reuse creates an exploration-versus-anchoring tradeoff: more memory can reduce errors but also suppress diversity and miss better solutions.

Related briefs

More plain-English summaries from the archive with nearby topics or operator relevance.

cs.AI

ObjectGraph: From Document Injection to Knowledge Traversal -- A Native File Format for the Agentic Era

Mohit Dubey, Open Gigantic

cs.MA

Trustworthy Self-Composable Big-Data-as-a-Service: An LLM-Orchestrated Multi-Agent Framework for Automated Data Engineering, AutoML, MLOps Deployment, and Drift-Aware Lifecycle Optimization

Aueaphum Aueawatthanaphisut, Badri Raj Lamichhane

cs.DB

FINER-SQL: Boosting Small Language Models for Text-to-SQL

Thanh Dat Hoang et al.

Thank you to arXiv for use of its open access interoperability. This product was not reviewed or approved by, nor does it necessarily express or reflect the policies or opinions of, arXiv.
LightDark