|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 187 - Issue 126 |
| Published: July 2026 |
| Authors: Keval Barvaliya |
10.5120/ijca54dc2360b436
|
Keval Barvaliya . Quantifying Representational Complexity in Transformer Models via Residual Stream Spectral Entropy. International Journal of Computer Applications. 187, 126 (July 2026), 9-25. DOI=10.5120/ijca54dc2360b436
@article{ 10.5120/ijca54dc2360b436,
author = { Keval Barvaliya },
title = { Quantifying Representational Complexity in Transformer Models via Residual Stream Spectral Entropy },
journal = { International Journal of Computer Applications },
year = { 2026 },
volume = { 187 },
number = { 126 },
pages = { 9-25 },
doi = { 10.5120/ijca54dc2360b436 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2026
%A Keval Barvaliya
%T Quantifying Representational Complexity in Transformer Models via Residual Stream Spectral Entropy%T
%J International Journal of Computer Applications
%V 187
%N 126
%P 9-25
%R 10.5120/ijca54dc2360b436
%I Foundation of Computer Science (FCS), NY, USA
Despite remarkable advances in the reasoning and generalization capabilities of large language models, the internal representational mechanisms that underlie these behaviors remain poorly understood. Current frameworks of evaluation are mainly based on the assumption of benchmark performance as a proxy for model capability and provide limited information about the organization and transformation of information in the network during inference. One of the main open questions in current interpretability work is the disconnect between the behavioral assessment and the understanding of the mechanisms. In this work, a principled metric, Residual Stream Spectral Entropy (RSSE), is proposed for measuring the representational complexity of transformer-based language models by analyzing their residual stream activations. The RSSE represents the entropy of the singular value distribution of the layer-wise residual representations, and hence a normalized score of the distribution of the representational energy of a model across latent computational subspaces. RSSE works directly on the activation geometry of the internal representations of the task, without relying on labels or probabilities of output. RSSE is measured across a variety of transformer model families with a wide range of scales, architectures, and training goals, using a variety of reasoning and language understanding benchmarks. The results presented in this paper indicate that higher-order reasoning tasks consistently demonstrate wider distributions across the spectrum than do factual retrieval and low-complexity classification tasks and that the RSSE grows monotonically as both increase in scale and complexity of the task. Interestingly, models with similar reasoning accuracy tend to produce similar entropy profiles despite their different architectures, indicating that entropy might be a feature of the computation of transformers in general, and not be solely a function of any individual model choice. These results provide a novel approach for investigating emergent capabilities, representation scaling, and the boundaries of interpretability for large neural systems.