aspireai.
PUBLIC EDITION

Labelling data with one gold answer hides the disagreement that real annotators actually have, so this benchmark scores a distribution

AspireAI community · arXiv
Single-label datasets cannot represent the fact that different human annotators reach divergent but defensible judgments on boundary cases, which is also why single-agent LLM annotation pipelines handle evolving guidelines poorly. ANT-A is a multi-annotator benchmark spanning 7 datasets across domains and modalities, carrying task-specific guidelines and 5 independent human labels per instance, and it scores with Fleiss kappa so a model is measured against the shape of the human label distribution rather than one gold answer. The companion framework ANT-OR refines prompts by distilling contrastive decision rules from positive and negative feedback, improving agreement-at-2-or-more accuracy by 4.5 points over the strongest baseline and landing within 2 points of the best Fleiss kappa alignment. The benchmark and code are released, and the paper is accepted to EMNLP 2026 Findings.
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.