aspireai.
PUBLIC EDITION

Skeleton Coding: developers who specify the program's structure cut mean test error 48.4 percent versus end-to-end behavioral specs alone

AspireAI community · arXiv (Amazon et al.)
A coding agent picks its own structure - a decomposition into data types, modules and functions - before your tests narrow it down, so a test set that fits one structure can leave another badly underdetermined. Skeleton Coding asks developers to state the structure in high-level, code-like form alongside the usual behavioral specs. Across four models and three benchmarks the best skeleton specifications cut mean test error 48.4 percent against the strongest end-to-end spec, and still help 27 percent even when the agent can query a complete reference implementation. Skeletons also narrowed the small-versus-large model gap by about 52 percent while lowering implementation cost 15 to 26 times. The paper models this as a control problem and argues the gain is exponential in the number of tests required - but the empirical sweep is four models on three benchmarks, so the scale is narrow even if the direction is clear.
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.