- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
this paper considers that gui agents keep meeting similar operations across tasks, and existing memory methods such as ExpeL [1] and Agent Workflow Memory [2] already store such experience but rarely check whether a recalled item actually applies to the task at hand. so the authors propose STEER, which keeps the executor frozen, turns trajectories, gates admission to a small deployed store. The novelty lies this admission gate plus operational compatibility filtering
Critical strengths
The representation is well designed. Each item carries applicability, completion conditions, scope, and provenance, so generation, validation, and retrieval share one interface (Sec. 3.1).
Critical weaknesses
reelated work misses earlier memory and skill-library efforts, e.g. Reflexion [3], the verified skill library of Voyager [4], the reflective memory stream of Generative Agents [5], and MemGPT [6]. IMO the paper should state what is new relative to their write and verify policies.
admission rule in Sec. 3.2 has no statistical grounding. i've also checked the supplementary part, where sec e.2 finds promoted vs rejected items differ by only with , so the gate is throttling rather than a quality test, tbh? sec c also shows the headline five-pass run used zero deployed reuse? i.e. the core mechanism stays untested at benchmark scale
all baselines are in-house append-all variants, as memory methods, e.g. ExpeL [1] and Agent Workflow Memory [2], are discussed but never run. the one comparison that isolates the lifecycle is not significant with p~0.42? and cumulative Pass@k over the same 117 tasks rewards retries. and only one benchmark, one executor, and one knowledge model, sec d shows Qwen generator drops Pass@3 by three tasks, the osworld run is unreplicated, sec i shows generation-token costs are untracked, and 12 deployed items after nine passes is a tiny memory, imo.
Questions for authors
see above comments