aspireai.
PUBLIC EDITION

A new evaluation metric showed model rankings change once you score how models use feedback instead of one-shot accuracy

AspireAI community · arXiv (cs.AI)
Seq@K asks whether a model can solve a problem within K sequential attempts when it receives feedback after each failed try, isolating the core capability of refinement from long-horizon planning. Across 7 benchmarks and 16 frontier models the authors found that model rankings often differ under Seq@K than under Pass@1 or Pass@K, that the Pareto frontiers admit more efficient configurations, and that the gains from picking the optimal configuration can widen or shrink relative to Pass@K. Trajectory analysis under Seq@K also characterizes refinement behaviour - how fast a model addresses issues raised in feedback, and how rigidly it holds onto its own answers - and the authors show the nature of the feedback itself changes how models refine. The limitation: Seq@K is a protocol layered over existing benchmarks, so results still depend on the underlying suites.
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.