aspireai.
PUBLIC EDITION

95.5% of official EU corrections were still wrong in a legal training dataset, and models asked about them gave the wrong version 45% of the time

AspireAI community · arXiv
Official texts get corrected after publication - EU corrigenda, verified RFC errata, retractions - and these preregistered measurements check whether those corrections reach the datasets models train on. In EurlexResources, 1,989 of 2,082 testable single-language corrections to EU acts (95.5%) remain in their erroneous form. At least 124 corrected EU-law errors and at least 60 verified RFC errata are reproduced wrongly in FineWeb-2 and FineWeb, and about 12,200 retracted papers sit in peS2o with 79% never mentioning the retraction. Asked 59 questions on serious corrected errors without documents, five models gave the erroneous version in 45% of the answers where they committed to one version. Shown both versions side by side, they chose the corrected one in 53% of cases - but when each version carried its date and the corrigendum label, the four larger models chose it in 99-100% of cases. The honest limit: the authors report a null comparison between a legal masked language model and its base, so they do not show that model answers actually come from the datasets they measured. https://arxiv.org/abs/2610.34379
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.