MemoCue: Strategy-Guided Memory Recall

• MemoCue is a cue-based memory support system that transforms original queries into cue-rich prompts using explicit recall strategies.
• It employs a hierarchical search with a 5W Recall Map and Monte Carlo Tree Search to optimize cue generation for effective memory activation.
• Evaluations reveal that MemoCue outperforms traditional retrieval methods, significantly improving recall accuracy and depth on multiple memory datasets.

Searching arXiv for the primary MemoCue paper and closely related memory/cueing systems to ground the article. arXiv search: (Zhao et al., 31 Jul 2025) MemoCue; related works (Kim et al., 24 Jan 2026) Memento, (Xia et al., 3 Feb 2026) Memora, (Wang et al., 20 May 2026) Mem-π. MemoCue is an LLM-based agent for human memory recall that addresses forgetting by transforming an original memory query into a cue-rich one through explicitly selected recall strategies, rather than relying only on retrieval from a stored memory bank. Its target setting is agent-assisted recall in situations such as the tip-of-the-tongue phenomenon, where the memory may still exist but is not immediately accessible without an effective cue. The system formalizes this as Strategy-Guided Recall (SGR), builds a Recall Router around a 5W Recall Map and a Recall Strategy Pool, and develops a fine-tuned agent that generates memory-inspired responses intended to help users progressively reconstruct their own memories (Zhao et al., 31 Jul 2025).

1. Problem setting and conceptual basis

MemoCue is motivated by a limitation of conventional memory-assistance methods: they mainly retrieve information from an equipped memory module and present it back to the user. The paper argues that this is inadequate in realistic settings because an agent cannot capture and store everything a user experiences, and because storage, privacy, and trust constraints limit how much personal memory can be retained in practice (Zhao et al., 31 Jul 2025).

The central conceptual shift is cue-based rather than storage-maximizing. The paper grounds this shift in memory theory, arguing that forgetting is often caused not by literal loss of the memory trace but by ineffective activation of the relevant memory. On that view, an assistant should not only search its own memory bank; it should generate effective cues that help the person activate their own memory. MemoCue therefore treats the agent’s role as strategic scaffolding of human recall. A plausible implication is that the system is designed less as an external memory repository than as an interaction policy for triggering latent autobiographical or episodic recall.

This orientation is visible in the paper’s canonical example. An original user query such as “Where are my keys?” is not answered directly. Instead, it may be transformed into a cue-rich query such as “Did you do anything unusual after returning home?”, using the strategy “Multiple Associations” (Zhao et al., 31 Jul 2025). The output is thus a recall-oriented intervention rather than a direct factual completion.

2. Formalization as Strategy-Guided Recall

MemoCue formulates its task as Strategy-Guided Recall, in which an original query $Q_u$ is transformed into a cue query $Q_c$ by applying a recall strategy chosen from a strategy set $S$: $Q_c = \mathcal{T}(Q_u, S)$ The purpose of this transformation is to maximize the chance that the user, not merely the model, can recover the target memory (Zhao et al., 31 Jul 2025).

The paper models strategy exploration as a Hierarchical Markov Decision Process. At the high level, the state is

$s_{t}^{h} = \left ( Q_u, H_t, M_t \right )$

where $Q_u$ is the original user query, $H_t$ is the dialogue history up to turn $t$, and $M_t$ is relevant memory retrieved from the user memory bank. High-level actions are the 15 recall strategy patterns. At the low level, the state is

$s_{t}^{l}=(s_{t}^{h},a_{t}^{h})$

and the low-level action is the generated cue query $Q_c$0, sampled from

$Q_c$1

with the selected cue query written as

$Q_c$2

(Zhao et al., 31 Jul 2025).

The search process terminates either when the interaction is judged successful or when the dialogue budget is exhausted: $Q_c$3 where $Q_c$4 is BERTScore-based similarity, $Q_c$5 is the current user response, and $Q_c$6 is the ground-truth answer (Zhao et al., 31 Jul 2025).

Reward is decomposed into three dimensions. Recall Focus is defined by Jaccard overlap: $Q_c$7 and Recall Depth counts the presence of memory elements: $Q_c$8 where the element types are Event, Person, Location, Temporal, and Decision. This reward design indicates that MemoCue is optimized not only for answer correctness but also for topical focus and richness of recalled memory content (Zhao et al., 31 Jul 2025).

3. 5W Recall Map and the recall strategy pool

The 5W Recall Map is MemoCue’s taxonomy for routing memory queries. Inspired by Lasswell’s 5W communication model, it maps memory-recall scenarios into five categories: What $Q_c$9 Event, Who $S$0 Person, Where $S$1 Location, When $S$2 Temporal, and Why $S$3 Decision. The paper’s claim is that different forgetting scenarios have different recall characteristics and therefore require different cueing strategies (Zhao et al., 31 Jul 2025).

5W category	Scenario	Recall strategy patterns
What	Event	Scenario Reconstruction; Interpersonal Interaction; Sensory Activation
Who	Person	Appearance Clues; Role Connection; Emotion Trigger
Where	Location	Multiple Associations; Immersive Recall; Spatial Cues
When	Temporal	Timeline Rewind; Key Milestones; Routine Pattern
Why	Decision	Background motivation; Option Comparison; Experience Support

Event queries are treated as reconstructions of what happened, often through contextual details, interpersonal involvement, or sensory traces. Person queries are routed through appearance, social role, or emotion. Location queries are handled through association, immersive scene reconstruction, or spatial layout. Temporal queries depend on sequence, milestones, or routine. Decision queries are treated as reconstructions of motives, option comparisons, or relevant prior experiences (Zhao et al., 31 Jul 2025).

The scenario mapper uses a fine-tuned RoBERTa classifier. The paper states that 2,000 samples were annotated using GPT-3.5-turbo with few-shot prompting, then manually verified, and then used to fine-tune RoBERTa. An appendix example pairs “When did I take my medication?” with the strategy “Routine Pattern” and the cue query “What time do you usually take your medication?” (Zhao et al., 31 Jul 2025). This illustrates the operational logic of the map: the original question is recast in the form of a likely retrieval cue.

4. Recall Router and hierarchical search

Recall Router is the main system architecture that turns the 5W taxonomy into a searchable cue-generation pipeline. It has two major parts: Theory-Supported Scenario Mapping and MCTS-Enhanced Strategy Exploration. The first classifies the query and narrows the candidate strategy set. The second uses a hierarchical recall tree and Monte Carlo Tree Search to explore strategy-response paths (Zhao et al., 31 Jul 2025).

At the high level, the search chooses among the 15 strategy patterns using UCT: $S$4 where $S$5 is average reward, $S$6 is the parent visit count, and $S$7 is the node visit count. Expansion selects a strategy, generates a cue query, simulates a user response, and updates the state. Simulation uses the multi-component reward described above, and backpropagation updates node values and visit counts through

$S$8

$S$9

(Zhao et al., 31 Jul 2025).

The search process is heuristic but explicit. The paper states that SGR-MCTS uses an $Q_c = \mathcal{T}(Q_u, S)$0-greedy exploration factor initialized at $Q_c = \mathcal{T}(Q_u, S)$1 and decreased by $Q_c = \mathcal{T}(Q_u, S)$2, runs for $Q_c = \mathcal{T}(Q_u, S)$3 iterations, and returns top-$Q_c = \mathcal{T}(Q_u, S)$4 paths with $Q_c = \mathcal{T}(Q_u, S)$5. It also notes that low-level cue query generation during search uses Qwen2.5-32B-Instruct, and that memory element richness for Recall Depth is also evaluated by Qwen2.5-32B-Instruct (Zhao et al., 31 Jul 2025).

This architecture makes strategy choice an explicit intermediate variable rather than leaving cue generation to unconstrained prompting. That design is central to MemoCue’s identity. The agent is not merely prompted to “be helpful”; it is routed into one of 15 abstract recall patterns and then optimized by tree search over simulated dialogue outcomes.

5. MemoStrategy dataset and model development

MemoCue is trained on an instruction-tuning dataset called MemoStrategy. The construction pipeline uses SGR-MCTS outputs to collect triples consisting of the original query $Q_c = \mathcal{T}(Q_u, S)$6, a selected strategy $Q_c = \mathcal{T}(Q_u, S)$7, and a cue query $Q_c = \mathcal{T}(Q_u, S)$8, then filters out invalid samples that fail to activate useful recall. The dataset format includes an Instruction describing the task and recall strategies, an Input containing the user query, and an Output containing the recommended strategy and predicted cue query response (Zhao et al., 31 Jul 2025).

The paper reports inconsistent dataset statistics across sections. In the main methodology section, MemoStrategy is described as having 5,805 samples split into 5,200 train and 605 test. In the appendix, it is described instead as having 4,805 samples split into 4,500 train and 305 test (Zhao et al., 31 Jul 2025). This inconsistency is one of the paper’s visible documentation issues.

Five open-source LLMs are fine-tuned on MemoStrategy: Qwen2.5-14B-Instruct, Qwen2.5-7B-Instruct, LlaMA-3-8B-Instruct, Mistral-7B-Instruct, and Yi-9B. Training uses LoRA, batch size 8 per GPU, learning rate $Q_c = \mathcal{T}(Q_u, S)$9, 5 epochs, and 8 Nvidia Tesla A100-80GB GPUs. The paper says the system leverages the function calling capability of LLMs to obtain structured outputs, but it does not provide a separate explicit supervised loss formula in the main text (Zhao et al., 31 Jul 2025).

The scenario classifier is developed separately. RoBERTa is fine-tuned on the 2,000 manually verified labels using an Nvidia Tesla A100-80GB GPU, 500 epochs, and batch size 32. The appendix further reports architectural parameters such as 24 hidden layers, hidden size 1024, 16 attention heads, intermediate size 4096, dropout 0.1, max position embeddings 514, and vocab size 50265 (Zhao et al., 31 Jul 2025). Together, these components form a hybrid system in which symbolic scenario mapping, search-based strategy optimization, and LLM instruction tuning are tightly coupled.

6. Evaluation and empirical results

MemoCue is evaluated on three long-term memory datasets: PerLTQA, LoCoMo, and MemoryBank. PerLTQA contains 141 user memory banks and 8,593 memory QA pairs, transformed into 35,179 short memory streams. LoCoMo contains 50 ultra-long conversations of around 300 turns and 9,000 tokens each. MemoryBank covers memory storage over 10 days for 15 virtual users and 194 probing questions (Zhao et al., 31 Jul 2025).

The main automatic metric is Balance of Recall Score (BRS): $s_{t}^{h} = \left ( Q_u, H_t, M_t \right )$0 where $s_{t}^{h} = \left ( Q_u, H_t, M_t \right )$1 is BERTScore-based response accuracy, $s_{t}^{h} = \left ( Q_u, H_t, M_t \right )$2 is cosine similarity between original and cue query, and $s_{t}^{h} = \left ( Q_u, H_t, M_t \right )$3. BRS explicitly rewards effective cueing while penalizing outputs that are too similar to the original query, thereby favoring genuine cue transformation over paraphrase (Zhao et al., 31 Jul 2025).

The best-performing MemoCue variant uses Qwen2.5-14B-Instruct as backbone and reaches BRS 78.15 on PerLTQA, 77.89 on LoCoMo, and 72.42 on MemoryBank, for an average of 76.15. The paper highlights gains of +9.58% on PerLTQA versus zero-shot, +11.24% on LoCoMo versus zero-shot CoT, and +8.71% on MemoryBank versus few-shot CoT. Other MemoCue backbones also outperform zero-shot, few-shot, zero-shot CoT, and few-shot CoT variants in every backbone family shown: Qwen2.5-7B-Instruct averages 73.38, Yi-9B 73.12, Mistral-7B-Instruct 70.72, and Llama-3-8B-Instruct 72.41 (Zhao et al., 31 Jul 2025).

The closed-source comparison remains favorable. On PerLTQA, MemoCue scores 76.32, exceeding gpt-3.5-turbo few-shot CoT at 66.34, gpt-4 few-shot CoT at 69.76, gpt-4o few-shot CoT at 70.11, and o1-preview few-shot CoT at 71.32. On LoCoMo, MemoCue scores 73.59, again exceeding the listed closed-source few-shot CoT baselines (Zhao et al., 31 Jul 2025).

Beyond BRS, the paper reports average memory-recall strategy prediction accuracy of 90.36% across the five LLMs. In LLM-based evaluation, MemoCue improves recall inspiration by 17.74%. In human evaluation, nine trained evaluators preferred MemoCue over gpt-4 with an 83% win rate, over gpt-4o with an 85% win rate, and over o1-preview with a 78% win rate (Zhao et al., 31 Jul 2025). The paper also notes one exception: on recall logicality, MemoCue is slightly worse than Qwen2.5-14B-Instruct, which the authors attribute to the larger parameter model’s stronger logical reasoning capacity.

Ablations show that both core components matter. Removing the 5W Recall Map reduces average performance by 3.28 points. Removing MCTS reduces it by 4.96 points. Removing both reduces it by 7.64 points, with especially large drops on LoCoMo (Zhao et al., 31 Jul 2025). These results support the claim that MemoCue’s gains come from structured scenario routing and search-based strategy optimization rather than from instruction tuning alone.

7. Position within cue-based memory research and limitations

MemoCue belongs to a broader family of systems that treat cues, rather than mere archival retrieval, as the core mechanism of memory support. Nearby work shows several adjacent formulations. Memento stores prior user queries together with referent, spatiotemporal, and activity contexts and proactively resurfaces them in AR when similar contexts recur (Kim et al., 24 Jan 2026). Memora treats cue anchors as first-class retrieval objects and balances abstraction with specificity in long-term memory systems (Xia et al., 3 Feb 2026). Mem-$s_{t}^{h} = \left ( Q_u, H_t, M_t \right )$4 generates task-adaptive guidance for agents and jointly learns when to generate guidance and when to abstain (Wang et al., 20 May 2026). Taken together, these papers suggest that cue-based memory support can be organized around situated context, explicit cue-anchor structures, or adaptive guidance generation; MemoCue’s distinctive contribution is to make recall strategy itself the explicit intermediate controller.

The paper’s limitations are also clear. It explicitly acknowledges the lack of real-world end-to-end human memory-recall datasets, which is why evaluation relies on proxy metrics, simulated user feedback, and curated long-term memory benchmarks rather than live large-scale recall studies (Zhao et al., 31 Jul 2025). The system depends heavily on the manually designed 5W Recall Map and the 15 strategy patterns, so taxonomy quality is a structural dependency. Its search process is optimized on simulated rather than live human interaction, and user-specific variability in cue effectiveness remains largely open.

The paper also leaves practical concerns unresolved. It motivates the work partly by storage and privacy constraints, but a full privacy-preserving deployment design is not developed. The MemoStrategy dataset statistics are inconsistent across sections. The conclusion states that future work will explore adaptive iteration strategies to improve scalability and conduct real-user pilot studies (Zhao et al., 31 Jul 2025). Even with those caveats, MemoCue’s broader significance is straightforward: it shifts memory-support system design from “store more and retrieve more” toward “ask better, strategy-conditioned questions.”