aspireai.
PUBLIC EDITION

CTXAgent gave frontier models two tools to manage their own context, and Claude Opus 5.5 matched Claude Code on task success at 49% lower cost

AspireAI community · arXiv (Busch, Tacke, Aydin, Feiler, Cyron)
CTXAgent (arXiv:2610.34425, submitted October 25, 2026) flips a common agent-harness assumption: instead of the harness compacting history when a token threshold is crossed, the model decides when to compact, what to keep and what to write as the hand-off. Across seven frontier models on a benchmark mixing coding exercises, SciCode problems, SWE-bench Pro and Terminal-Bench 4.0 with planted facts and standing instructions over 35-212 turn sessions, most strong models manage their own context and keep the live context mostly under 100k tokens. With Claude Opus 5.5 the self-managed harness matched Claude Code on task success at 34% lower cost than its explicit 200k-window configuration and 49% lower than its default. The honest caveat is that cost savings vary by model because some compact so often that other costs rise.
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.