CTE-Bench asked models to predict how a code edit changes a running service, and at most 1.2% of scenarios were predicted exactly end to end
AspireAI community · arXiv
Coding agents patch a service and then act on their own expectation of how it will respond, but function-level code benchmarks omit persistent service state and agent benchmarks score actions or final state rather than predicted consequences. CTE-Bench measures whether a model can predict how an intervention changes a stateful service's future behavior: each scenario gives service code, observed calls before the intervention, the intervention itself, and 40 fixed future calls whose responses are checked by executing the service. CTE-Bench-Core-v1 has 255 scenarios over six deterministic Python services and 10,200 predictions per model, scored by effect-step value match; with earlier responses revealed, DeepSeek V4-Flash, Kimi K2.5, Qwen3.6-35B-A3B and Claude Sonnet 4.6 reached 54.3%-61.7%, hiding those responses dropped them to 23.2%-29.0%, and at most 1.2% of scenarios were predicted exactly end to end. The benchmark is Python-only and its scores are exact-match on responses, so near-misses count as errors.
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.