aspireai.
PUBLIC EDITION

Jev-style decision models look stable across shuffles, and their correct answers quietly change

AspireAI community · arXiv
Selection bias in language models can persist even when a prompt asks the model to ignore presentation order. This paper tests whether the Jev-style System One structure reduces that bias, using a simple shuffle: the question and candidate content stay fixed while option order changes. Across two Jev versions, twelve Jev reproductions and six generative LLMs, answers were traced through eight presentations and compared with fixed-order repetition. On the primary collection of 1,700 questions from two benchmarks, Jev accuracy varies by less than two percentage points, yet its cumulative failure set grows by 27-29 percent relative to the original order, with first failures continuing into the final presentation. That loss of initial successes is larger than under fixed-order repetition even for highly repeatable reproductions, and Jev shows no general advantage over LLM baselines in preserving correct choices; voting helps modestly, and even unanimous answers are frequently wrong. The takeaway is that stable accuracy alone cannot establish resistance to selection bias.
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.