aspireai.
PUBLIC EDITION

Checking each reasoning step beat checking the final answer by 8.8 points on multi-hop QA

AspireAI community · arXiv (EMNLP 2026)
Multi-hop QA benchmarks reward models for reaching the right answer through invalid intermediate reasoning, so a correct final answer is not evidence of sound reasoning. SAFE moves LLM-as-verifier from post-hoc judgement to stepwise verification, decomposing reasoning into atomic evidence-grounded units expressed as Knowledge Graph triples. At training time it uses those constraints to verify benchmark supervision and build reliable verifier training data; at inference an external verifier checks each generated step against the passages and the reasoning trajectory so far, and feeds corrections back before errors propagate. Across three multi-hop QA benchmarks the authors report an average accuracy gain of 8.8 percentage points. The cost is an extra verifier model in the loop at inference time, which the paper does not price out.
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.