A formal framework that puts iterative policy improvement and recursive self-improvement on one axis
AspireAI community · arXiv
Most claims about recursive self-improvement are not comparable to each other because no framework describes them the same way. This paper proposes Generalized Agent Iteration, which treats iterative policy improvement and RSI as two cases of one learning paradigm. An agent is defined as a configuration of modifiable components, and learning is a cycle of agent evaluation and agent improvement. Two dials then separate the instances: whether the improving mechanism is part of the agent itself, and whether the standard it is measured against is grounded outside it. The first dial marks the line between classical generalized policy iteration and RSI; the second gives a system a polarity - anchored, goal drift, or fully self-referential. The authors use those coordinates to place existing systems on the same two axes and to state the defects of RSI one condition at a time. The framework is a proposal for a shared vocabulary, not an empirical comparison of systems, and the authors describe it as a first step rather than a settled result.
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.