---
title: "Twists and Turns: A Graph-Based Benchmark and Framework for Long-Term Memory in Exploration Tasks"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2611.06414v1"
permalink: "https://feed.astralor.com/items/itm_63e4a31492161ce28f7080c7"
published: "2026-11-04T12:13:52.000Z"
score: 60
channel: "tech"
tags: ["RAG","多模态","Twists","Turns","Graph-Based Benchmark","Framework","Long-Term Memory","Exploration Tasks Long-term"]
---

# Twists and Turns: A Graph-Based Benchmark and Framework for Long-Term Memory in Exploration Tasks

## 速览

Long-term problem-solving processes, such as scientific research and software development, proceed along an evolving trial-and-error trajectory toward a central goal. We term these \textit{exploration tasks}, which requ…

## 关键点

- Long-term problem-solving processes, such as scientific research and software development, proceed along an evolving trial-and-error trajectory toward a central goal.
- We term these \textit{exploration tasks}, which require models to remember not only facts but also how solutions are tested against intermediate outcomes and early attempts are continually revised or revived.
- However, existing long-term memory research focuses on factual recall and updates, overlooking the interconnected nature of exploration.

## 全文

Long-term problem-solving processes, such as scientific research and software development, proceed along an evolving trial-and-error trajectory toward a central goal. We term these \textit{exploration tasks}, which require models to remember not only facts but also how solutions are tested against intermediate outcomes and early attempts are continually revised or revived. However, existing long-term memory research focuses on factual recall and updates, overlooking the interconnected nature of exploration. We observe that exploration processes naturally form graphs, with branching approaches linked by revisions and reconsiderations. Motivated by this, we propose \textsc{LExMem}, a graph-guided benchmark designed to evaluate \underline{\textsc{Mem}}ory in \underline{\textsc{L}}ong-term \underline{\textsc{Ex}}ploration tasks. We model exploration processes as graphs and introduce an evolutionary mechanism to increase their structural complexity, yielding 224 dialogues and 2,018 question-answer instances derived from graph structures. Building on the same insight, we propose \textsc{LExGraph}, a graph-based memory framework that incrementally organizes dialogues into interconnected memory nodes and retrieves evidence through hybrid retrieval and neighbor expansion. Extensive experiments demonstrate that \textsc{LExMem} poses a significant challenge to existing retrieval- and memory-based systems, whereas \textsc{LExGraph} achieves superior performance and generalizes effectively to external benchmarks. Codes and datasets are available at https://github.com/mbzuai-nlp/LExMem.

---

引用前请核对原文;本文由星际流动整理:https://feed.astralor.com/items/itm_63e4a31492161ce28f7080c7