Kai Li, Xin Li, Yao Xu, Yi Zeng, Jie Tan, Jitao Sang, Ziyi Ni, Xuanqing Yu, Chengbao Liu, Zheqing Zhang, Xiaogang Duan, Xuelei Wang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Long-horizon conversational agents have to manage ever-growing interaction histories that quickly exceed the finite context windows of large language models (LLMs). Existing memory frameworks provide limited support for temporally structured information across hierarchical levels, often leading to fragmented memories and unstable long-horizon personalization. We present TiMem, a temporalhierarchical memory framework that organizes conversations through a Temporal Memory Tree (TMT), enabling systematic memory consolidation from raw conversational observations to progressively abstracted persona representations. TiMem is characterized by three core properties: (1) temporal-hierarchical organization through TMT; (2) semantic-guided consolidation that enables memory integration across hierarchical levels without finetuning; and (3) complexity-aware memory recall that balances precision and efficiency across queries of varying complexity. Under a consistent evaluation setup, TiMem achieves state-of-the-art accuracy on both benchmarks, reaching 75.30% on LoCoMo and 76.88% on LongMemEval-S. It outperforms all evaluated baselines while reducing the recalled memory length by 52.20% on LoCoMo. Manifold analysis indicates clear persona separation on LoCoMo and reduced dispersion on LongMemEval-S. Overall, TiMem treats temporal continuity as a first-class organizing principle for long-horizon memory in conversational agents. The code is available at https: //github.com/TiMEM-AI/timem.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2601.02845")
get_code_for_paper("2601.02845")
have("2601.02845")
Connect an agent — have() is free.