Newly released test suites expose two blind spots that have long lurked behind headline scores: how faithfully an LLM‑augmented agent preserves useful information across millions of tokens, and whether it can reshuffle its plan when hidden rules surface mid‑game. The field has been chasing end‑task success while silently assuming that memory and planning stay reliable under the hood.
Prior memory‑policy work trained agents with only outcome‑level rewards, which “introduce a severe credit assignment problem: it fails to localize intermediate memory degradation and provides no explicit supervision to suppress noise accumulation during recursive summarization.” [1] This leaves agents blind to the gradual erosion of task‑relevant facts. Likewise, planning benchmarks have treated constraints as a static checklist, ignoring the reality that world and user rules often emerge only after an initial proposal.
MMPO tackles the memory blind spot by attaching a self‑supervised Belief Entropy signal to each summary, and the authors report that “experiments show that MMPO consistently outperforms existing methods on diverse long‑horizon tasks, maintaining 97.1% performance even when scaled to 1.75M‑token contexts.” [1]
AdaPlanBench flips the planning script: agents must propose a plan, receive feedback about hidden violations, and then revise. Under this pressure “experiments on ten leading LLMs show that adaptive planning under dual constraints remains challenging, with the best model reaching only 67.75% accuracy.” [2]
The benchmark also quantifies the scaling of difficulty: “performance degrades as more constraints accumulate, with user constraints posing a particularly large challenge and failures often stemming from weaker physical grounding and reduced effectiveness.” [2] This mirrors the authors’ observation that “User‑Constraint Only is consistently harder than World‑Constraint Only, while Both Constraints is the most demanding setting.” [2]
A third suite probes stance simulation, revealing how easily a model’s inferred opinion can be nudged. The multimodal revision that injects a meme “produces an average directional shift of +49.3%, compared with +44.8% for the add strategy and –4% for the paraphrase control.” [3] Even purely textual edits can swing simulated stance by a large margin, with the add strategy producing an average directional shift of +44.8%.
These results leave several questions open. MMPO’s belief‑entropy proxy is still a heuristic; it is unclear whether it scales beyond the reported 1.75 M tokens or how it interacts with external knowledge sources. AdaPlanBench, while extensive, confines itself to 307 household scenarios, so its conclusions may not transfer to industrial or high‑risk domains. The stance‑shift audit tests simulated users, not real people, so the measured volatility may over‑ or under‑estimate true societal impact. A natural next step is to ask whether a single agent architecture can jointly minimize belief entropy while tracking an evolving constraint graph, and how such a system would behave under adversarial context injections.
If these benchmarks are taken as the new reliability baseline, the immediate effect will be a reshuffling of agent leaderboards: any model that cannot keep above ~97% performance in the MMPO benchmark (which evaluates up to 1.75 M‑token contexts) or achieve the best reported adaptive‑planning accuracy of 67.75% on AdaPlanBench should be considered for further safety evaluation. Re‑evaluating existing agents on MMPO, AdaPlanBench, and the stance‑revision suite will surface latent failure modes that current safety glosses overlook.
