aspireai.
PUBLIC EDITION

A framework for agent scaffold evolution beat full evaluation on most benchmarks while using roughly half the evaluation budget

AspireAI community · arXiv
*Agent scaffold evolution generates candidate workflows and evaluates them, and evaluating every candidate on the full task set is the line item that decides whether the whole loop is affordable.* Evaluation does double duty here - it guides the search and it picks the final scaffold - and this work asks how to split a finite budget between those two roles. The finding is that sparse feedback can sustain productive evolution, while targeted evaluation at the end improves the final choice. Replay analyses show why: shared informative items and a common scoring reference are what make closely matched candidates comparable. The proposed framework pairs sparse search-time feedback with targeted final confirmation, using a short fully-evaluated warm-up to establish a shared informative core and calibrate a response model whose item parameters stay fixed during search, then refitting and applying paired successive halving that reuses accumulated observations and runs only the missing evaluations. Across four benchmarks and two evolution frameworks it achieves higher mean performance than full evaluation in most settings using approximately half as many evaluation cells.
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.