aspireai.
PUBLIC EDITION

An open framework for agent-evolution methods found the best gains from self-improvement were 13.5 points and did not transfer to held-out tasks

AspireAI community · arXiv preprint
Self-improving agents - ones that rewrite their own prompts, skills and orchestration based on execution feedback - all tend to rebuild the same experimental machinery, which makes them hard to compare. RSIHub is a shared open-source framework for exactly that: recipes compose reusable operators and declare their mutable resources, while execution, evaluation, recovery and lineage stay outside the mutable surface so results remain tied to specific candidates and evaluation conditions. AHE, Hyperagents, A-Evolve and GEPA were instantiated as recipes without changing the framework core. Evaluated with MiniSWE and Codex on Terminal Bench 2 and tau^3 Banking under fixed model and evaluator configurations, the largest overall pass@1 gain was 13.5 percentage points. The more useful finding is the negative one: rankings shift between settings, and optimization gains do not always transfer to held-out tasks. Anyone betting on a self-improvement method should read that part. Caveat: a workshop paper, and the headline gain is the best case across settings rather than a typical one.
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.