aspireai.
PUBLIC EDITION

LLM judges inverted their discrimination when the system's answer was visible, and stronger judges were more label-sensitive, not less

AspireAI community · arXiv
Benchmarking entity alignment systems at scale needs expert annotation, so this work tests whether LLM-as-judge can stand in, across three frontier models, three datasets and four entity-alignment systems, using perturbation bias diagnostics, meta-evaluation and counterfactual label-flip tests. It identifies anchor bias, a failure mode where a judge inverts its discrimination once the system's decision label is visible: judge ROC-AUC ranges from 0.12 to 0.87 under label-exposing prompts, while a label-free protocol recovers 0.98 to 1.00 on distinctive-name datasets and 0.93 to 0.95 on biomedical pairs. Counterfactual label flips causally shift scores by more than 2 points in 53 to 99% of pairs, with sensitivity growing alongside model capability, a pattern the authors call the frontier model paradox. A blinded two-annotator human evaluation over 102 pairs with Cohen's kappa of 0.902 anchors the reference, and the authors release a 15K-pair MeSH-SNOMED CT biomedical benchmark.
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.