Chronos: Temporal-Aware Conversational Agents with Structured Event Retrieval for Long-Term Memory
- URL: http://arxiv.org/abs/2603.16862v1
- Date: Tue, 17 Mar 2026 17:59:20 GMT
- Title: Chronos: Temporal-Aware Conversational Agents with Structured Event Retrieval for Long-Term Memory
- Abstract summary: We introduce Chronos, a temporal-aware memory framework for conversational AI.<n> Chronos decomposes raw dialogue into subject-verb-object events with resolved datetime ranges and entity aliases.<n>At query time, Chronos applies dynamic prompting to generate tailored retrieval guidance for each question.
- Score: 0.7723674433972977
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recent advances in Large Language Models (LLMs) have enabled conversational AI agents to engage in extended multi-turn interactions spanning weeks or months. However, existing memory systems struggle to reason over temporally grounded facts and preferences that evolve across months of interaction and lack effective retrieval strategies for multi-hop, time-sensitive queries over long dialogue histories. We introduce Chronos, a novel temporal-aware memory framework that decomposes raw dialogue into subject-verb-object event tuples with resolved datetime ranges and entity aliases, indexing them in a structured event calendar alongside a turn calendar that preserves full conversational context. At query time, Chronos applies dynamic prompting to generate tailored retrieval guidance for each question, directing the agent on what to retrieve, how to filter across time ranges, and how to approach multi-hop reasoning through an iterative tool-calling loop over both calendars. We evaluate Chronos with 8 LLMs, both open-source and closed-source, on the LongMemEvalS benchmark comprising 500 questions spanning six categories of dialogue history tasks. Chronos Low achieves 92.60% and Chronos High scores 95.60% accuracy, setting a new state of the art with an improvement of 7.67% over the best prior system. Ablation results reveal the events calendar accounts for a 58.9% gain on the baseline while all other components yield improvements between 15.5% and 22.3%. Notably, Chronos Low alone surpasses prior approaches evaluated under their strongest model configurations.
Related papers
- A Graph-Native Bitemporal Memory Store for Conversational AI Agents [0.0]
We describe an agent-local Neo4j property graph augmented with HNSW vector indexes and a full bitemporal data model.<n>Each memory is stored as an immutable identity node linked to versioned content nodes carrying two closed-open time intervals.<n>We evaluate the system on LongMemEval, a 500-question benchmark spanning six question types designed to stress long-term memory.
arXiv Detail & Related papers (2026-07-29T06:40:52Z) - Memory-Augmented Query Intent Understanding for Efficient Chat-based Image Retrieval [74.93546115702155]
Chat-based image retrieval allows the human-interactive system to iteratively clarify and refine user intent through multi-round dialogue.<n>The key challenge in this task lies in dynamically understanding and updating the user's query intent across dialogue rounds.<n>This paper proposes a novel and efficient memory-based user intent updating framework for the chat-based image retrieval task.
arXiv Detail & Related papers (2026-05-17T10:17:41Z) - APEX-MEM: Agentic Semi-Structured Memory with Temporal Reasoning for Long-Term Conversational AI [8.933188286750795]
APEX-MEM is a conversational memory system that combines three key innovations.<n>Property graphs structure conversations as temporally grounded events in an entity-centric framework.<n>Retrieval agent understands and resolves conflicting or evolving information at query time, producing a compact and contextually relevant memory summary.
arXiv Detail & Related papers (2026-04-15T19:25:02Z) - PERMA: Benchmarking Personalized Memory Agents via Event-Driven Preference and Realistic Task Environments [72.02445514666428]
We introduce PERMA, a benchmark designed to evaluate persona consistency over time beyond static preference recall.<n>PerMA consists of temporally ordered interaction events spanning multiple sessions and domains, with preference-related queries inserted over time.<n> Experiments demonstrate that by linking related interactions, advanced memory systems can extract more precise preferences and reduce token consumption.
arXiv Detail & Related papers (2026-03-24T14:04:11Z) - Memory-T1: Reinforcement Learning for Temporal Reasoning in Multi-session Agents [80.33280979339123]
We introduce Memory-T1, a framework that learns a time-aware memory selection policy using reinforcement learning (RL)<n>On the Time-Dialog benchmark, Memory-T1 boosts a 7B model to an overall score of 67.0%, establishing a new state-of-the-art performance for open-source models.
arXiv Detail & Related papers (2025-12-23T06:37:29Z) - A Question Answering Dataset for Temporal-Sensitive Retrieval-Augmented Generation [40.00268164578221]
ChronoQA is a large-scale benchmark dataset for Chinese question answering.<n>It contains 5,176 high-quality questions covering absolute, aggregate, and relative temporal types with both explicit and implicit time expressions.
arXiv Detail & Related papers (2025-08-17T08:12:59Z) - LoopServe: An Adaptive Dual-phase LLM Inference Acceleration System for Multi-Turn Dialogues [59.12542274007847]
LoopServe is an adaptive dual-phase inference framework for large language models in multi-turn dialogues.<n>LoopServe consistently achieves superior effectiveness compared to existing baselines.
arXiv Detail & Related papers (2025-07-18T06:12:08Z) - From Single to Multi-Granularity: Toward Long-Term Memory Association and Selection of Conversational Agents [79.87304940020256]
Large Language Models (LLMs) have been widely adopted in conversational agents.<n>MemGAS is a framework that enhances memory consolidation by constructing multi-granularity association, adaptive selection, and retrieval.<n> Experiments on four long-term memory benchmarks demonstrate that MemGAS outperforms state-of-the-art methods on both question answer and retrieval tasks.
arXiv Detail & Related papers (2025-05-26T06:13:07Z) - Toward Conversational Agents with Context and Time Sensitive Long-term Memory [8.085414868117917]
Until recently, most work on RAG has focused on information retrieval from large databases of texts, like Wikipedia.
We argue that effective retrieval from long-form conversational data faces two unique problems compared to static database retrieval.
We generate a new dataset of ambiguous and time-based questions that build upon a recent dataset of long-form, simulated conversations.
arXiv Detail & Related papers (2024-05-29T18:19:46Z) - Evaluating Very Long-Term Conversational Memory of LLM Agents [95.84027826745609]
We introduce a machine-human pipeline to generate high-quality, very long-term dialogues.
We equip each agent with the capability of sharing and reacting to images.
The generated conversations are verified and edited by human annotators for long-range consistency.
arXiv Detail & Related papers (2024-02-27T18:42:31Z) - Recursively Summarizing Enables Long-Term Dialogue Memory in Large Language Models [30.48902594738911]
Given a long conversation, large language models (LLMs) fail to recall past information and tend to generate inconsistent responses.<n>We propose to generate summaries/ memory using large language models (LLMs) to enhance long-term memory ability.
arXiv Detail & Related papers (2023-08-29T04:59:53Z) - History-Aware Hierarchical Transformer for Multi-session Open-domain
Dialogue System [59.78425104243993]
We propose History-Aware Hierarchical Transformer (HAHT) for multi-session open-domain dialogue.
HAHT maintains a long-term memory of history conversations and utilizes history information to understand current conversation context.
Experimental results on a large-scale Multi-Session Conversation dataset suggest that the proposed HAHT model consistently outperforms baseline models.
arXiv Detail & Related papers (2023-02-02T06:54:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.