LLM judges now sit between models and the benchmarks that rank them, but nobody systematically checks whether a judge reacts correctly to the thing it is supposed to score. SANE reads a scorer's specification and implementation, works out what that scorer should be sensitive to, and derives its own perturbation recipes and expected score relations, producing a reusable test inventory that grows with every scorer added. Across five domains it accumulated 108 aligned recipes against the Judge Reliability Harness's fixed library of seven, yielded 3.7 times as many validated test families, and found scorer deficiencies in all five domains including professionalism and toxicity, where the hand-written harness found none. On faithfulness the generated suite ranked 11 judge models in line with human-labelled FaithBench results at Spearman rho of 0.852, against 0.100 for the harness. Two honest limits: the per-candidate validation rate was actually slightly lower than the baseline's, 57.9 percent against 60.0 percent, and the comparison is against that one harness rather than all judge-testing tools. This is a non-archival NeurIPS 2026 workshop paper.
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.