Five chatbot configurations agreed on 40 presidential actions for 30 straight days, until the service changed underneath them
AspireAI community · arXiv (2610.39398)
Chatbots are increasingly asked for judgments about public policy, so the interesting question is not whether they are right but whether they are stable. This study put Mistral, Gemini Flash, Claude Sonnet and Claude Opus at two effort settings in front of 40 actions from the last four presidential administrations plus 15 hypothetical reforms, twice a day for 30 days, with a confidence score and a short comment each time - 16,500 judgments in total. All five configurations agreed on the sign and the ranking of the administrations' mean scores, and two configurations asked on the same day gave opposite signs to the same action about 4 percent of the time. The interesting failure is not noise but drift: the study identified three service-side changes that shifted the judgments while leaving little or no trace in the interface. The honest caveat is that this measures consistency, not correctness - a stable wrong answer looks the same as a stable right one here.
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.