AgentOCR: Reimagining Agent History via Optical Self-Compression (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have enabled agentic systems trained with reinforcement learning over multi-turn interaction, but practical deployment is bottlenecked by rapidly growing textual histories that inflate token and memory costs. |
| Approach: | They propose a framework that represents the accumulated observation-action history as a compact rendered image. |
| Outcome: | The proposed framework preserves over 95% of text-based agent performance while significantly reducing token consumption (>50%), yielding consistent token and memory efficiency. |
Similar Papers
MemSearch-o1: Empowering Large Language Models with Reasoning-Aligned Memory Growth in Agentic Search (2026.acl-long)
Copied to clipboard
Sheng Zhang, Junyi Li, Yingyi Zhang, Pengyue Jia, Yichao Wang, Xiaowei Qian, Wenlin Zhang, Maolin Wang, Yong Liu, Xiangyu Zhao
| Challenge: | Existing methods for memory management struggle to capture fine-grained semantic relations between queries and documents. |
| Approach: | They propose a framework for reasoning and agentic search that grows fine-grained memory fragments from seed tokens from queries, then retraces and deep refines the memory via a contribution function. |
| Outcome: | Experiments on eight benchmark datasets show that MemSearch-o1 significantly mitigates memory dilution and more effectively activates reasoning potential of diverse LLMs. |
Memp: Exploring Agent Procedural Memory (2026.findings-acl)
Copied to clipboard
Runnan Fang, Yuan Liang, Xiaobin Wang, Jialong Wu, Shuofei Qiao, Pengjun Xie, Fei Huang, Huajun Chen, Ningyu Zhang
| Challenge: | Large Language Models (LLMs) based agents suffer from brittle procedural memory that is manually engineered or entangled in static parameters. |
| Approach: | They propose a procedural-memory repository that distills past agent trajectories into fine-grained, step-by-step instructions and higher-level, script-like abstractions. |
| Outcome: | The proposed repository can be used to improve agents' performance on travelplanner and Alfworld. |
AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems (2026.acl-long)
Copied to clipboard
| Challenge: | Automated expansion methods often result in bloated structures with redundant agents, leading to excessive token consumption. |
| Approach: | They propose a plug-and-play compression framework for graph-structured multi-agent workflows . they estimate the importance score of each agent and remove redundant agents . |
| Outcome: | Experiments show that AgentSlimming reduces average token cost by 78.9% with negligible performance degradation. |
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. |
Contextual Experience Replay for Self-Improvement of Language Agents (2025.acl-long)
Copied to clipboard
| Challenge: | Existing large language model (LLM) agents fail in complex tasks without any environment-specific experiences. |
| Approach: | They propose a framework that accumulates and synthesizes past experiences into a dynamic memory buffer to enable efficient self-improvement for language agents in their context window. |
| Outcome: | The proposed framework improves performance on WebArena and VisualWebAren . it surpasses tree search method with fewer token costs and achieves state-of-the-art performance of 31.9%. |
OCR-Memory: Optical Context Retrieval for Long-Horizon Agent Memory (2026.acl-long)
Copied to clipboard
| Challenge: | Existing LLMs are limited by text-context budgets, resulting in token-expensive storage of raw trajectories . Optical Context Retrieval Memory (OCR-Memory) renders historical tra-jectorios into images annotated with unique visual identifiers. |
| Approach: | They propose a framework that leverages the visual modality as a high-density representation of agent experience. |
| Outcome: | Optical Context Retrieval Memory (OCRM) renders historical trajectories into images annotated with unique visual identifiers. |
Text or Pixels? Evaluating Efficiency and Understanding of LLMs with Visual Text Inputs (2025.findings-emnlp)
Copied to clipboard
| Challenge: | *visual text representations* are a practical and surprisingly effective form of input compression for decoder LLMs. |
| Approach: | They exploit visual representations to render long text inputs as a single image and provide it directly to the model. |
| Outcome: | The proposed method reduces token usage while preserving performance. |
VizoMem: A Visual-Textual Memory Framework for Efficient Long-Horizon Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing systems that use long-context modeling incur computational and memory overhead. |
| Approach: | They propose a visual memory framework that pre-rendered text into structured images and stored as visual notes for agentic systems. |
| Outcome: | The proposed system reduces token consumption while preserving effective long-term memory recall. |
Lightweight LLM Agent Memory with Small Language Models (2026.acl-long)
Copied to clipboard
Jiaquan Zhang, Chaoning Zhang, Shuxu Chen, Zhenzhen Huang, Pengcheng Zheng, Zhicheng Wang, Ping Guo, Fan Mo, Sung-Ho Bae, Jie Zou, Jiwei Wei, Yang Yang
| Challenge: | Existing external memory systems for LLMs have low online overhead but are unstable in accumulating latency over long interactions. |
| Approach: | They propose a lightweight memory system for better agent memory driven by Small Language Models . lightmem modularizes memory retrieval, writing, and long-term consolidation . they show consistent gains across model scales and high efficiency . |
| Outcome: | The proposed system improves agent memory but has low latency and low online overhead . it separates online processing from offline consolidation to enable efficient memory invocation . the proposed system achieves an average F1 improvement of 2.5 over A-MEM on LoCoMo . |
AgentGL: Towards Agentic Graph Learning with LLMs via Reinforcement Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing agentic frameworks treat external information as unstructured text and fail to leverage topological dependencies inherent in real-world data. |
| Approach: | They propose to reframe graph learning as an interleaved process of topology-aware navigation and LLM-based inference. |
| Outcome: | The proposed framework outperforms strong GraphLLMs and GraphRAG benchmarks in multiple LLM backbones. |