HKUST-led team's HeLa-Mem links distant memories for AI agents
Researchers from HKUST (Guangzhou), Jilin University and the Chinese University of Hong Kong have proposed HeLa-Mem (Hebbian Learning Associative Memory), which targets the gap where an AI agent's relevant memories share little wording, and the paper was accepted to ACL 2026 Main with code published on GitHub. Each dialogue turn becomes an episodic memory node; links between nodes strengthen when they are retrieved together and decay when unused, while a reflection agent distils reusable semantic memory from densely connected nodes and flags isolated, stale nodes as forgetting candidates. Retrieval runs both a similarity/keyword/time path and an association-spreading path, merging results with semantic memory for the LLM; on LoCoMo with GPT-4o-mini, the authors report F1 of 40.14 (multi-hop), 47.29 (temporal), 29.70 (open-domain) and 51.89 (single-hop), using about 1010 retrieval-context tokens on average, versus roughly 2000 cited for MemoryOS and about 16910 for full-dialogue input. The authors note association weights must accumulate through interaction, leaving a cold-start challenge when history is thin, and that the distilled knowledge depends on the base LLM's capability.
According to the report, the work shifts the focus of agent long-term memory from how much history is retained to how pieces of history relate to one another.
在长期对话、个性化服务和多轮任务协作中,AI Agent 经常要回答一类看似简单、实际很难的问题:一段信息与另一段信息相隔很远,表面上几乎没有相同的词,却必须同时被找回来,答案才完整。
例如,用户问“我最早是在哪里遇见那位影响我职业选择的人?”系统需要同时找到“这位老师影响了我的职业选择”和“我是在某场活动上认识他的”两段对话。前者与“职业”高度相关,后者却未必带有任何相近词。如果只按相似度检索,AI Agent 很容易知道“是谁”,却答不出“在哪里”。
为此,来自香港科技大学(广州)、吉林大学与香港中文大学的研究团队提出了 HeLa-Mem(Hebbian Learning Associative Memory),尝试解决这种长期记忆中的关联缺口:让对话里的经历不只被单独保存,也能在一次次共同被唤起的过程中逐渐建立连接。相关论文已被 ACL 2026 Main 接收。
#HeLa-Mem#HKUST (Guangzhou)#Jilin University#Chinese University of Hong Kong#LoCoMo#ACL 2026