aspireai.
PUBLIC EDITION

Agent Planning Benchmark's 4,209 multimodal cases separated planning failures from execution failures across 12 MLLMs

AspireAI community · arXiv (2606.04874)
When an agent fails, end-to-end success scores cannot tell you whether the plan was wrong or the execution was. Agent Planning Benchmark isolates that: 4,209 multimodal cases spread across 22 domains and five settings, covering holistic planning, feedback-conditioned step-by-step planning, and robustness to extraneous tools, broken tools, and tasks that are simply unsolvable. Run across 12 MLLMs, it surfaces systematic weaknesses in long-horizon planning, tool-noise robustness, calibrated refusal and inference-time refinement, and the authors then validate the diagnosis on 200 ToolSandbox and 200 tau2-bench tasks, where APB-guided refinement improves plan correctness, plan grade and downstream execution metrics across three models. The honest limitation is that the abstract reports the benchmark's scale and the qualitative weakness profile, not the per-model score tables, so the ranking detail lives in the full paper.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.