Balancing memory compression with performance in LLM-based agents
Determine the appropriate balance between memory compression rates and downstream task performance in memory modules for large language model–based agents, by characterizing how textual or latent memory extraction and compression affect accuracy and cost and by identifying strategies that retain salient information while minimizing token usage and inference latency.
References
Therefore, how to strike an appropriate balance between compression and performance remains an open question, and there may also be alternative approaches that aim to retain as much salient information as possible during the extraction or compression process.
Kernel-managed shared memory reliably outperforms a standard RAG pipeline and an unmanaged external memory backend across all three models, at lower latency than full unfiltered context; the naive_concat comparison is more nuanced, tying on two of three models with a Llama-3.1:8B deficit unexplained by scale, left to future work.
Total cost savings are \textbf{not established}.
Since probe-gated re-surfacing did not recover the static-plan loss (\S\ref{sec:compression}), whether such a self-refreshing scratchpad survives compression better than a static block is an open question we hope this workshop takes up.
A dedicated survey reviews these methods in detail; from the lifecycle perspective, the open questions are whether folded trajectories should be written back to long-term memory, in what form, and whether information lost in folding can later be recovered.