CORTEXA
← Browse
arxivcs.LG2026-07-18

The Anatomy of a Truth Direction: Knowledge-Dependent Dimensionality, a Relational Law, and a Convergent Category Geometry in Small Language Models

Francesco Karim Vicidomini

Bürger et al. (2024) demonstrated that truth representations in large language models are universal across statement polarity but reside within a multidimensional subspace. We extend this framework along three questions: how the dimensionality of the subspace depends on the model's knowledge, which architectural component builds the truth direction, and what the direction is a mixture of. In Part I, a training-free directional probe derived from the SVD of hidden-state minimal pairs shows that the dimensionality of truth is knowledge-dependent: the signal concentrates on a single axis for known facts and diffuses as knowledge decreases. In Part II, a relational law emerges across multiple model families: attention propagates truth frames, the feed-forward network opposes the current block's frame, and post-peak decay is causally attributed to the SwiGLU value stream. Furthermore, per-category truth axes form a semantically signed arrangement that converges across families. Stress tests expose a sign instability in this orientation, which we repair with a spectral consensus gauge to sharpen the convergence into a knowledge-gated law. Finally, a replication campaign on Gemma-2-2b, extending our decomposition tools to accommodate its sandwich normalization, confirms these laws and attributions. We quantify the knowledge gate as classical attenuation and isolate a stable, model-specific private geometry.

View free PDFSource page

Related papers

arxivcs.LG2026-06-26

Continual Learning for Sequential Personalization of Small Language Models: A Stability Monitoring Analysis

Thomas S. Paula, Lucas S. Kupssinskü, Rodrigo C. Barros

Small Language Models (SLMs) are increasingly being considered for deployment on edge devices such as laptops, enabling private, low-latency, and locally personalized applications. However, personalization requires models to adapt over time to evolving user- or task-specific data…

View free PDFSource page
arxivcs.CLcs.LG2026-07-21

Scaling Laws for Hypernetwork-Based Knowledge Injection in Large Language Models

Nischay Dhankhar, Dos Baha, Abulhair Saparov

Injecting factual knowledge into large language models (LLMs) reliably and at scale remains an open challenge. Hypernetworks provide a promising solution to large-scale knowledge injection. Although hypernetworks are typically applied for test-time adaptation, we explore their us…

View free PDFSource page
arxivcs.LG2026-07-03

Poisson-Gamma Modeling of Inter-Relational Dependencies in Dynamic Knowledge Graphs

Nan Fang, Yijun Wang, Hao Liao, Sikun Yang

Dynamic knowledge graphs are ubiquitous in today's AI applications, as we represent molecular structures, social relationships, and language information using these graph models. As knowledge graphs evolve over time and are often noisy and incomplete, modeling their temporal and…

View free PDFSource page
arxivcs.AIcs.LG2026-07-14

Enhancing Small Language Models Reasoning through Knowledge Graph Grounding

Dimitrios Kelesis, Konstantinos Bougiatiotis, Georgios Paliouras

Although large language models (LLMs) have set benchmarks for zero-shot reasoning, their deployment remains cost-prohibitive and environmentally taxing. Small Language Models (SLMs) offer a sustainable alternative, but prone to errors, on tasks requiring complex, multi-hop logica…

View free PDFSource page
arxivcs.AIcs.LG2026-07-14

Improving Molecular Property Prediction in Small Language Models Using Graph-based Tools

Konstantinos Bougiatiotis, Dimitrios Kelesis, Georgios Paliouras

Small language models (SLMs) have shown promise for zero-shot molecular property prediction from SMILES strings, yet they often suffer from structural blindness because sequence representations under-specify key graph-topological cues. We propose a modular Context-Augmented Promp…

View free PDFSource page
arxivcs.LG2026-07-03

Reward Granularity in RLVR: Comparing Process and Outcome Reward Structures for Mathematical Reasoning in Small Language Models

Anagha Radhakrishna Palandye, Rebecca Glick, Osheen Kaul

Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a promising paradigm for improving mathematical reasoning in language models. Yet most RLVR work rewards only the final answer (outcome-based rewards), leaving the impact of step-level process supervision (proce…

View free PDFSource page