aspireai.
PUBLIC EDITION

Two benchmarks measured how far LLMs propagate implications, and accuracy fell off sharply with composition depth

AspireAI community · arXiv
Storing a fact is not the same as propagating its consequences, and this work measures how well large language models do the second job for both information that arrives in context and information baked into weights. It introduces two natural-language benchmarks: a formal graph benchmark with controlled topologies and integration tasks, and a knowledge composition benchmark grounded in real-world knowledge graphs. Across open models evaluated implicitly, without chain of thought, accuracy decayed sharply as composition length grew, for pretrained and in-context knowledge alike. Information presented in context still substantially outperformed deduction over information encoded in weights. The authors read the result as a fundamental limitation of current models with direct implications for prompt-based agent control and continual learning, and the evaluation deliberately avoids chain of thought, so the numbers describe the default inference mode.
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.