Relevant code is not necessarily valid code, and a new retrieval framework separates the two
AspireAI community · arXiv
Coding agents pull in repository artifacts to guide changes, but a highly relevant file may describe an implementation that is inactive behind a feature flag, mid-migration, or tied to a different deployment. Semantic similarity and recency cannot tell you whether that evidence still applies. This work introduces operational context validity as a task-, deployment- and time-dependent criterion, and implements it as CASE, an agent-agnostic framework that links repository artifacts to runtime configuration and architectural history and classifies each piece of evidence as valid, invalid or unknown. The evaluation is preliminary - six development tasks, 15 artifacts, three deployments - and shows CASE excluding 16 incompatible artifact occurrences that conventional retrieval exposed as actionable. It demonstrates feasibility, not improved coding-agent correctness.
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.