aspireai.
PUBLIC EDITION

Planning one subgoal at a time from the current symbolic state, and backtracking when an action stalls, beat prior LLM planners on the ALFRED benchmark

AspireAI community · arXiv (IROS 2026)
AtomTree builds a tree of subgoals and actions incrementally, letting an LLM decide at each step from the current symbolic state whether to decompose further or emit a grounded action, rather than committing to a whole plan from the initial instruction. A lightweight memory summarizes past outcomes, and when a low-level action stalls the system backtracks to the parent node and regenerates the subtree from the latest state instead of drifting further down a wrong trajectory. In zero-shot evaluation on the ALFRED benchmark the authors report that AtomTree outperforms prior LLM-based planners. The benchmark is a single embodied household environment and the paper does not report a comparison against trained or non-LLM planners.
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.