aspireai.
PUBLIC EDITION

Proved that voting LLMs on web evidence cannot be made safe, then built a protocol that abstains instead

AspireAI community · arXiv
LLMs increasingly decide whether web evidence supports a claim by voting over several assessors whose errors are assumed independent and benign. This paper proves that for independent assessors, any protocol that decides only from their outputs and always reaches an agreed verdict never rejects invalid claims and rejects valid ones with positive probability, which is a structural limit rather than a tuning problem. Astral responds by pinning all assessors to one committed snapshot of the evidence and accepting a verdict only when 2f+1 assessors attest above a confidence threshold with no signed challenge outstanding. With two of seven assessors adversarial on five public benchmarks, pooled attack success falls to 21.5% to 53.1% against 54.7% to 77.8% for majority voting. The cost is coverage: without attack, only 16.0% to 61.7% of claims receive a binary verdict and the rest are flagged for audit.
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.