SearcharxivSearch

arXiv subjects

Jort Gemmeke

Publications and source records attributed to Jort Gemmeke.

2 recordsLinked to original sources

Experience Graphs: The Data Foundation for Self-Improving Agents

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.

cs.DB

Detecting Irregular Orbits in Gravitational N-body Simulations

We present a qualitative diagnostic based on the continuous wavelet transform, for the detection of irregular behavior in time series of particle simulations. We apply the method to three qualitatively different gravitational 3-body encounters. The intrinsic irregular behavior of these encounters is well reproduced by the presented method, and we show that the method accurately identifies the irregular regime in these encounters. We also provide an instantaneous quantification for the degree of irregularity in these simulations. Furthermore we demonstrate how the method can be used to analyze larger systems by applying it to simulations with 100-particles. It turns out that the number of stars on irregular orbits is systematically larger for clusters in which all stars have the same mass compared to a multimass system. The proposed method provides a quick and sufficiently accurate diagnostic for identifying stars on irregular orbits in large scale N-body simulations.

astro-ph