Skip to content
Preprint

When Your Agent Opens the Chat App: Agent-Controlled Search over Raw Chat Logs Rivals Structured Memory

Aug 2026 · 1 citation · 43 references
Computer Science

TL;DR

The results indicate that for precise, evidence-grounded questions over chat archives, much of the benefit credited to elaborate memory structures is recoverable by giving an agent controllable search over the unmodified record, with no LLM-based index construction at all.

Abstract

Agent-memory systems increasingly buy retrieval quality with structure, transforming raw conversation histories into summaries, embeddings, trees, or knowledge graphs before any question is asked. We ask how much of that benefit comes from the structure itself, rather than from competent retrieval over the raw history. We present ReFind, an agent-controlled search interface that builds no semantic structure at all: it leaves the conversation archive unmodified, indexes it lexically at turn granularity, and combines a generic iterative keyword-search loop with four chat-native controls grounded in empirical refinding work: session-aware rank fusion, local context expansion, temporal narrowing, and skipping already-inspected sessions. A separate reasoning stage answers from the collected evidence. Across a broad suite of conversational-memory tasks (single- and multi-hop QA, event ordering, and fact consolidation), roughly 2,800 questions on precise-retrieval and fact-tracking capabilities evaluated under the incremental multi-turn setting of MemoryAgentBench, ReFind attains the highest mean accuracy (58.2) of any system compared, above the strongest graph- and tree-based memory systems (HippoRAG 2, 53.2), all under a GPT-4o-mini backbone matched to every reused baseline. Controlled comparisons to single-shot BM25, a matched generic-agentic BM25 control, component removals, and agentic dense/hybrid variants separately support the roles of agent control, chat-native controls, and lexical retrieval. On LongMemEval-S/M, the same interface reaches 93.2 +/- 3.3 and 89.3 +/- 6.0 with GPT-5-mini. The results indicate that for precise, evidence-grounded questions over chat archives, much of the benefit credited to elaborate memory structures is recoverable by giving an agent controllable search over the unmodified record, with no LLM-based index construction at all.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

When Users Don't Ask: Benchmarking Context-Driven Memory Retrieval in Conversational Agents

Large language models (LLMs) are increas- ingly deployed as long-horizon conversational agents, motivating growing interest in mem- ory systems. However, existing benchmarks primarily evaluate memory through QA-style probing rather than in-situ conversational usage. We introduce LOCOMO-CONV, a conversa- tional memory b...

Wen-Yu Chang, Yun-Nung Chen · 3 citations · ⚡1
#natural language process... Preprint Sep 2026

RuleMem: Active Rule Memory for Long-Term Conversational Agents

A rule-based memory framework that induces reusable logical rules from historical interactions to guide both evidence retrieval and reasoning, and constructs natural-language Horn clauses from conversations and validates them via a Rule Perplexity Consistency (RPC) mechanism.

Xing-Yuan Zeng, Zuo-Han Wu, Quanming Yao et al. · 0 citations
Jul 2026

The Prompt Is Not the Query: How Request State Evolves Across Multi-Turn AI Conversations

Categorical results support session-level measurement for AI search, and length-matched nulls show that low lexical coverage is largely a consequence of turn length, so vocabulary results are interpreted as information availability, not semantic drift.

Benjamin Tannenbaum · 2 citations
Open access 2026

Persistent Goal-Tracking and Instruction-Driven Reasoning in Sequential Conversation QA

GSC-QA (Goal-based Sequential Conversation QA), a framework that integrates three complementary components into a unified enterprise dialogue architecture that combines retrieval, instruction enforcement, and goal persistence in a single coordinated loop built on LangGraph, is introduced.

Quoc-Dung Ngo, Quang-Dung Dang, Ly-Huynh Phan · 0 citations
Jul 2026

LazyMem: Retrieve Broadly, Construct Selectively for Efficient Long-Term Agent Memory

LazyMem is introduced, which resolves this tension by deferring all memory construction to query time and generalizes to LoCoMo without target-domain training and reduces mean latency relative to the prior query-time baseline.

Jing Yu, Yibo Zhao, Jiaming Zhang et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.