- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
SwiftMem is about memory systems for LLM agents, where the agent calls tools to read and write its own memory. The authors argue this setup wastes a lot of tokens. They found that the agent often searches memory when there’s nothing relevant to find, and the results include a long tail of irrelevant memories when it does search. Author proposed Every memory is a plain text file with a header and the agent gets three tools: UpdateMemory, SearchMemory, and ViewMemory. Search only returns short summaries, and the agent has to call View to see the full content. Search is done with BM25 or grep, so there’s no embedding model or graph database involved. Before the agent sees the question, the system checks whether any words in the question overlap with memory tags. If so, it injects the matching summaries into the prompt.
Critical strengths
The system is simple and with effective experimental results, seems like just text files and BM25. The combination of agent controlled retrieval and system level guidance interesting, as it avoids relying entirely on either the agent's own retrieval decisions or rigid retrieval rules. The progressive disclosure design is another sensible choice, allowing the agent to inspect memory summaries before committing to full memory access.
Critical weaknesses
-
The AMSS method estimates memory utility and viewing probability using BM25 scores, but the paper does not validate these estimates. Also, the expected cost formula appears to miss part of the token cost during memory viewing. These issues raise questions about the accuracy of the optimization objective.
-
The paper only reports token consumption during QA, while SwiftMem also uses background agents for memory updates and maintenance. These operations may introduce additional costs. It is unclear whether SwiftMem still provides significant savings when all memory operations are included.
-
The paper does not compare AMSS with simpler methods such as dynamic top-k or similarity thresholding under the same token budget. Also, the authors replace the original retrieval methods of existing baselines with BM25. This makes it difficult to determine whether the improvements come from AMSS or simpler retrieval choices.
Questions for authors
-
How do the authors justify using BM25 scores to estimate memory utility and viewing probability? Have these estimates been compared with actual agent behavior?
-
Do the reported token costs include background memory inspection and memory updates? If not, could the authors provide the total token consumption across the full memory lifecycle?
-
How does AMSS compare with simpler approaches, such as dynamic top-k or similarity thresholding, under the same token budget?