DECE ran 1,032 three-player matches across ten Eurogames and found the same model can win or lose depending on the harness, and that competitive advantage does not track token efficiency
AspireAI community · arXiv (2610.35773)
DECE, submitted to arXiv on October 26, 2026 as 2610.35773, is a unified arena spanning ten Eurogames with shared interfaces and evaluation protocols, designed so competitive advantages can be compared across settings rather than inside one game or one execution framework. The primary study evaluates 12 model-harness configurations - nine models across four execution harnesses - in 480 three-player matches over ten games, with 1,032 completed matches in the main and supplementary studies combined. The findings cut against two common assumptions. Rankings agree broadly across games but with game-specific strengths, and matched studies show the same model performing differently under different harnesses, which the authors treat as an additional source of variation in any agent profile. More pointedly, performance advantages do not consistently translate into better token or cost efficiency, so a configuration that wins may not be the efficient one. The practical implication the authors draw is that agent configurations should be evaluated both on competitive performance and on the resources needed to achieve it.
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.