This work mathematically formalizes how transformers execute abstract reasoning and provides a novel, strictly geometric signature for evaluating factual reliability, proving that deep LLM latent spaces natively organize into Small-World networks.
Abstract
Large Language Models (LLMs) demonstrate remarkable multi-hop reasoning capabilities over long contexts, yet the internal mechanisms enabling these distant cognitive leaps remain poorly understood. Traditional attention-based interpretability often fails to capture true semantic proximity due to routing artifacts like attention sinks. In this paper, we bypass attention weights to directly analyze the dynamic geometry of the hidden state manifold, proving that deep LLM latent spaces natively organize into Small-World networks. By sparsifying the continuous similarity matrices of long-context representations into unweighted graphs, we trace the connectivity between highly disjoint semantic anchors across two distinct architectures. Our findings reveal a sharp topological phase transition: while early syntactic layers remain entirely fractured, deep reasoning layers abruptly compress massive conceptual distances into highly navigable pathways strictly bounded by the"Six Degrees of Separation"limit (=<6 semantic hops). Furthermore, we demonstrate the practical efficacy of this framework by applying it to zero-shot hallucination detection within Retrieval-Augmented Generation (RAG) using the RAGognize dataset. We show that factually grounded generations maintain structural integrity with their source context (approximately 3 hops), whereas hallucinations induce severe topological collapse. Ultimately, this work mathematically formalizes how transformers execute abstract reasoning and provides a novel, strictly geometric signature for evaluating factual reliability.
This work presents the first comprehensive mechanistic interpretability study of MLA, training a 114M-parameter transformer and analyzing its representations through SVD, attention head taxonomy, linear probing, and a disruption-attribution analysis.
S. Dhruvil, Fenil Sojitra, R. Chauhan· arXiv.org· 0 citations
This work proposes RSF-GLLM, a framework decoupling differentiable graph reasoning from answer generation, and introduces flow sparsity regularization to theoretically guarantee convergence from soft probabilities to discrete reasoning paths.
This work proposes a training-free model compression approach based on the tensor-train decomposition, whereby each pre-trained token embedding is converted into a lower-dimensional matrix product state (MPS), and comprehensively investigates what language capabilities are preserved under training-free compression at d...
Mingxue Xu, Y. Xu, Danilo P. Mandic· Machine Intelligence Researc...· 0 citations
Text-attributed graphs are widely used across domains, offering rich opportunities for zero-shot learning via graph-text alignment. However, existing methods struggle with tasks requiring fine-grained pattern recognition, particularly on heterophilic graphs. Through empirical and theoretical analysis, we identify an ov...
Heng Zhang, Jin Huang· Proceedings of the 32nd ACM...· 0 citations
It is found that SAE activation sets do not recover human category boundaries or within-category typicality more faithfully than dense embeddings or residual-stream states, but instead track model-internal similarity structure.
Nikolai Bolik, Lennart Stöpler, Artur Andrzejak· 0 citations
This paper introduces LaGR, a novel approach for integrating global information in knowledge graph reasoning that compresses the graph into a fixed, compact set of latent summaries and applies exact self-attention within this latent space, resulting in scale-invariant attention and stable performance across diverse dat...
Chen Lin, Lei Wang, Yin Zhang et al.· Proceedings of the Thirty-Fi...· 0 citations
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.