AnchorMem: Anchored Facts with Associative Contexts for Building Memory in Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing memory systems rely on summarization to preserve contextual nuances and obscuring key retrieval features. |
| Approach: | They propose a method that decouples the retrieval unit from the generation context. |
| Outcome: | The proposed method outperforms baseline models on the LoCoMo benchmark. |
Similar Papers
HyperMem: Hypergraph Memory for Long-Term Conversations (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to long-term memory management rely on pairwise relations, causing fragmented retrieval. |
| Approach: | They propose a hypergraph-based hierarchical memory architecture that explicitly models high-order associations using hyperedges. |
| Outcome: | Experiments show that HyperMem achieves state-of-the-art performance with 92.73% accuracy for long-term conversations. |
Context-Efficient Retrieval with Factual Decomposition (2025.naacl-short)
Copied to clipboard
| Challenge: | Existing models that use dynamically expanding text can be incorporated into large language models. |
| Approach: | They show that pre-processing external corpus into semi-structured "atomic facts" reduces the size of the context and improves inference efficiency. |
| Outcome: | The proposed form of atomic facts improves on question answering tasks when the amount of retrieved text is limited. |
Anchor-based Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) require massive GPU memory due to their size and parameter count. |
| Approach: | They propose to use anchor-based self-attention network and anchor-basic inference strategy to compress sequence information into an anchor token, reducing the keys/values cache and enhancing inference efficiency. |
| Outcome: | The proposed model reduces the key/value cache and improves inference efficiency by 99% while maintaining similar accuracy levels. |
Bridging Intuitive Associations and Deliberate Recall: Empowering LLM Personal Assistant with Graph-Structured Long-term Memory (2025.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs)-based personal assistants struggle to capture entity relationships and handle multiple intents effectively. |
| Approach: | They propose a graph-structured memory framework that mimics human cognitive processes and an event-centric memory graph. |
| Outcome: | The proposed framework outperforms retrieval and QA methods across long-term dialogue benchmarks and enables more human-like memory systems. |
RecMem: Recurrence-based Memory Consolidation for Efficient and Effective Long-Running LLM Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing memory systems invoke LLMs to extract episodic and semantic memory, and this leads to substantial token consumption. |
| Approach: | They propose a method that stores incoming interactions in a subconscious memory layer and encodes them using lightweight embedding models for retrieval. |
| Outcome: | Experiments show that RecMem reduces the memory construction token cost of three SOTA memory systems by up to 87% while exceeding their accuracy. |
Out-of-Context Reasoning in Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | a lightweight technique trains only new token embeddings on axioms and evaluates them on unseen tasks. |
| Approach: | They propose a lightweight technique that trains only new token embeddings on axioms . they train only new embeddables and evaluate them on unseen tasks . |
| Outcome: | The proposed technique trains only new token embeddings on axioms and evaluates them on unseen tasks. |
HiGMem: A Hierarchical and LLM-Guided Memory System for Long-Term Conversational Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing memory systems rely on vector similarity for retrieval, resulting in bloated evidence sets . existing systems produce little additional recall, but this approach lowers retrieval precision . |
| Approach: | They propose a two-level event-turn memory system that uses event summaries as semantic anchors to predict which related turns are worth reading. |
| Outcome: | The proposed system achieves the best F1 on four of five question categories and improves adversarial F1 from 0.54 to 0.78 over A-Mem while retrieving an order of magnitude fewer turns. |
Resonant Context Anchoring: Decoupling Attention Routing and Signal Gain at Inference Time (2026.findings-acl)
Copied to clipboard
Mingkuan Zhao, Yide Gao, Wentao Hu, Suquan Chen, Tianchen Huang, Zhenhua An, Zetao Chang, Xiayu Sun, Yuheng Min
| Challenge: | Existing mitigation strategies rely on suppressing specific neuron activations or employing computationally expensive contrastive decoding mechanisms, which often result in increased perplexity or significantly elevated inference latency. |
| Approach: | They propose a lightweight inference-time intervention method grounded in the perspective of residual stream signal dynamics to resolve the signal attenuation of external evidence during its propagation through deep networks. |
| Outcome: | The proposed method improves contextual faithfulness across multiple factual consistency and strong knowledge-conflict tasks while maintaining the model’s general language understanding capabilities. |
StructMem: Structured Memory for Long-Horizon Behavior in LLMs (2026.acl-short)
Copied to clipboard
| Challenge: | Existing memory systems lack structure and efficiency in capturing relationships between events. |
| Approach: | They propose a structure-enriched hierarchical memory framework that preserves event-level bindings and induces cross-event connections. |
| Outcome: | The proposed framework preserves event-level bindings and induces cross-event connections while reducing token usage, API calls, and runtime compared to prior memory systems. |
EVEDIT: Event-based Knowledge Editing for Deterministic Knowledge Propagation (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge editing approaches only operate on (subject, relation, object) triple . current methods are limited to (substance, relation) triple, causing low confidence in their answers. |
| Approach: | They propose a task of event-based knowledge editing that pairs facts with event descriptions to improve model confidence. |
| Outcome: | The proposed method improves model confidence by 55.6% while maintaining the naturalness of generation. |