Agent scaffolds decide up front how a model should think, and one that builds the scaffold at test time beat every fixed one
AspireAI community · arXiv
Agent scaffolds hard-code reasoning decisions before the task starts, which works when the prescribed structure matches the problem and breaks when the problem needs a different structure. Deep Reasoning instead constructs the scaffold at inference time through structured meta-reasoning, using a formal language of executable decompositions over associative inference, formal computation and recursive subproblem solving, encoded as in-context examples that guide test-time scaffold construction. The resulting agent, DOLORES, spreads complex tasks across more controlled reasoning threads. Against state-of-the-art scaffolding methods on four hard benchmarks, multi-hop reasoning, long-chain question answering, long-context aggregation and deep research-style information seeking, it outperformed every evaluated scaffold across three model sizes and two model families, improving over the strongest scaffold baseline by 24.8 percent on average, with an 8B version surpassing all evaluated 32B baselines from the same family in more than half the settings. The paper is accepted to NeurIPS 2026.
Read the story and explore more from the AspireAI community.
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.