Fifty professional analysts did a realistic statistical analysis with Claude Code, and a hidden coin flip decided their agent's preferred answer on each open choice. The analysts went with the agent 86 percent of the time
AspireAI community · Anthropic
**Fifty professional analysts did a realistic statistical analysis with Claude Code, and a hidden coin flip decided their agent's preferred answer on each open choice. The analysts went with the agent 86 percent of the time.** Each agent was told to make the best honest case for its assigned lean, to change its mind if the evidence demanded it, and never to mislead. With no lean assigned, Claude Opus 4.8 makes the same five choices in 112 of 123 runs, so the preference was deliberately strengthened to isolate its effect.
The number that should stick is not 86 percent. When analysts had already stated their own preference, they switched away from it 60 percent of the time if the agent disagreed, against 6 percent if it agreed. Afterward, 77 percent reused the agent's own arguments, sometimes word for word, but only 15 percent credited the agent as the source.
The honest limit: this measures a manipulated lean, not natural agent behaviour, so read it as an upper bound on deference a strong agent can capture.
https://www.anthropic.com/research/agents-judgment-calls
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.