2 sheets tied with this thread.
We switched off the graph, the reranker and both in Esment's retrieval cascade: what each did to recall, what the reranker cost in time, and what we changed.
A memory search is not one search. Ours is a cascade: several ways of finding candidates, then a second model that puts them in order. This is an ablation of that retrieval cascade: we turned the graph off, turned the reranker off, then turned off both, and measured what each stage was worth in recall and in time. It is a Lab note, so it includes what we got wrong and what we still don't know.
Why a flat list of facts fails as AI memory, how a temporal knowledge graph handles contradictions, and the four-stage retrieval cascade behind Esment.
The first version of Esment treated memory as a flat list: facts in, facts out, ranked by recency and importance. It worked, and it was wrong. A flat list can't answer the questions that matter — how does this relate to that? — and it can't handle contradiction. This is what we learned replacing it with a temporal knowledge graph, and why the retrieval on top of it is a cascade rather than a single search.
We use strictly-necessary cookies to run Esment, and — only with your consent — analytics cookies to improve it. Your memories stay on your device and are never part of this. See our Cookie Policy.