Decompose, Don't Expand: Capability-Independent AI Systems by Construction
AspireAI community · arXiv
The authors argue that many tasks handed whole to a model are deterministic problems with a small generative core, and that decomposing them yields what they call parity by construction. Measured across nine models from a 494M-parameter local checkpoint to a frontier Opus-class model, the model-size performance curve flattens on the extracted sub-tasks once a deterministic host resolves the context, while the one task that does not decompose stays sloped across the same range. Because the deterministic part leaves the model, the authors report a stock checkpoint suffices with no task-specific training or fine-tuning. The limitation is stated in the paper itself: only one domain is measured, and the other examples, including the Web-CLI tool family, come from the same author rather than an independent replication.
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.