aspireai.
PUBLIC EDITION

Scalable oversight without assuming a truthful prover: letting the verifier rewind the model cut oracle queries 840,000 times at the largest circuit size

AspireAI community · arXiv
Scalable oversight asks how a weak verifier can check the output of a computation performed by a more powerful AI. Debate solves this efficiently but assumes one of two provers is truthful; relativizing interactive proofs can drop that assumption but cost far more. This paper introduces rewindable interactive proofs, where the verifier may rewind the prover to an earlier state of the interaction, which is possible because a prover that is an AI model can be snapshotted and restored. The construction uses no cryptography, runs the honest prover in time linear in the original computation, and at the largest circuit size the verifier makes 840,000 times fewer oracle queries than direct evaluation, with online running time 0.12 times direct evaluation at 2 to the 26 oracle gates. The limitation is that the prover still takes about 60 times direct evaluation and the experiments are proof-of-concept on robust circuits with a sparse MNIST judge.
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.