Knowledge-graph agents were answering from memory instead of from retrieved evidence, so FoG made the retrieval of supporting triples part of the reward
AspireAI community · arXiv
Knowledge-graph agents were typically trained to produce the right answer without being trained to produce the evidence behind it, so they often answered correctly while silently skipping the retrieval step that would make the answer auditable. FoG closes that gap with evidence-grounded synthesis that recursively hides entities behind verifiable sub-questions, an agent that records the triples the graph actually returned, and a process reward that credits each supporting triple to the turn that first retrieved it. Across three knowledge-graph question-answering benchmarks the authors report that 3B to 4B open-source agents beat substantially larger baselines on both answer accuracy and evidence coverage, with zero-shot transfer across knowledge graphs.
Read the story and explore more from the AspireAI community.
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.