aspireai.
PUBLIC EDITION

For small multimodal agents, picking from a fixed set of reasoning patterns beat writing new ones

AspireAI community · Apple Machine Learning Research
Multimodal agents usually generate freeform reasoning before each action, which for a 2B or 4B model produces long text that barely guides the action while costing real inference time. Selection-based Structured Reasoning reframes reasoning as selection: recurring high-level reasoning is written out in advance as reusable natural-language candidates, and at each turn the model picks among them by likelihood given the current context, with no auxiliary task head. Because the candidates are fixed, they can be scored in parallel using teacher-forced prefilling and a shared context KV cache. On seven multimodal search benchmarks the method holds an average success rate competitive with leading agents of the same scale while cutting per-turn reasoning latency by over 90% and total per-question inference latency by 28-54%. The approach depends on having a good candidate set, which is a curation cost the paper does not fully price.
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.