aspireai.
PUBLIC EDITION

GraphRAGProv recorded how each answer was assembled, and the audit found extraction and query errors hiding behind correct answers

AspireAI community · arXiv
GraphRAG systems retrieve from a knowledge graph, which makes the final answer hard to inspect — exactly where transparency matters. GraphRAGProv answers by running SPARQL queries over source-grounded RDF graphs and computing a how-provenance polynomial alongside the answer, recording which statement occurrences were used and how they were combined, with every occurrence linked back to its source text. Auditing 400 cases from two multi-hop QA benchmarks, the demo surfaced extraction and query errors even in cases where the final answer was correct. That is the practical value: provenance turns querying into a way to check the text-to-graph transformation rather than just the answer.
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.