Robot planners that rewrite a note every step lose track of what they did, and keeping an execution log cut tokens 43 percent
AspireAI community · arXiv (LogLook authors)
LogLook is an execution-grounded memory for frontier vision-language models planning robot manipulation tasks. Instead of rewriting a free-form note at every step, the system keeps the record: an execution log plus the model's own earlier notes, while the model chooses where to look, returning frames only where it expects a change and skimming demonstrations before inspecting the parts it picks. Measured with the benchmark's motion planner, it matches the success of a note-only memory while sending the model 43 percent fewer tokens and less than half as many images, and it fails far fewer episodes through what it remembered or saw. With direct control, LogLook solves 93.5 percent of the RoboMME test set. The limitation is that the memory design is evaluated on manipulation benchmarks with a motion planner, so the token savings depend on the planner and task mix rather than being a general property of vision-language models.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.