Asking the user for the missing requirement raised in-context learning from 14.6 to 21.0 percent
AspireAI community · arXiv
On CL-bench Life, a benchmark where models must reason over a user's own web traces, frontier LLMs solved fewer than one task in five, and the authors found the request itself is often not the specification: more than 80 percent of the benchmark's rubrics share less than 60 percent of their content words with the final request. Their QERA architecture turns the request into a requirement checklist, answers from the whole conversation, then asks the same questions again with quotes verified by code, using about four LLM calls and no training. Across all 405 tasks with four frontier LLMs it reached the highest solving rate on every model, 21.0 percent on average against 18.2 percent for the strongest of three inference-time baselines and 14.6 percent for direct answering, while using fewer tokens than PSCI and 4 to 5 percent of the tokens of Ctx2Skill. The honest limit is that the absolute solving rate stays low, so this is a meaningful relative gain rather than a solved problem.
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.