TensorLLM: Tensorising Multi-Head Attention for Enhanced Reasoning and Compression in LLMs
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
The reasoning abilities of Large Language Models (LLMs) can be improved by structurally denoising their weights, yet existing techniques primarily focus on denoising the feed-forward network (FFN) of the transformer block, and can not efficiently utilise the Multi-head Attention (MHA) block, which is the core of transformer architectures. To address this issue, we propose a novel intuitive framework that, at its very core, performs MHA compression through a multi-head tensorisation process and the Tucker decomposition. This enables both higher-dimensional structured denoising and compression of the MHA weights, by enforcing a shared higher-dimensional subspace across the weights of the multiple attention heads. We demonstrate that this approach consistently enhances the reasoning capabilities of LLMs across multiple benchmark datasets, and for both encoder-only and decoder-only architectures, while achieving compression rates of up to ~ 250 times in the MHA weights, all without requiring any additional data, training, or fine-tuning. Furthermore, we show that the proposed method can be seamlessly combined with existing FFN-only-based denoising techniques to achieve further improvements in LLM reasoning performance.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 28 of its 38 references that are in the map. First posted on arXiv 26 Jan 2025.
Builds on
28 of 38 references.
Closest ancestors · 1
Same direction, newest first
- 2023The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reduction21 Dec
Other references · 27
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023GPT-4 Technical Reportcited by 18,396
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2016Layer Normalizationcited by 5,669
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2015A large annotated corpus for learning natural language inferencecited by 1,847
- 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,375
15 more
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 1,003
- 2019Text Summarization with Pretrained Encoderscited by 556
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
- 2019Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Settingcited by 349
- 2019Learning Deep Transformer Models for Machine Translationcited by 309
- 2019A Multiscale Visualization of Attention in the Transformer Modelcited by 292
- 2019Analyzing the Structure of Attention in a Transformer Language Modelcited by 243
- 2020On the Effect of Dropping Layers of Pre-trained Transformer Modelscited by 118
- 2016TensorLy: Tensor Learning in Pythoncited by 104
- 2019Language Modeling with Deep Transformerscited by 96
- 2024Compressing Large Language Models using Low Rank and Low Precision Decompositioncited by 59
- 2019Compression and Interpretability of Deep Neural Networks via Tucker Tensor Layer: From First Principles to Tensor Valued Back-Propagationcited by 9
- 2023SVDinsTN: A Tensor Network Paradigm for Efficient Structure Search from Regularized Modeling Perspectivecited by 9
- 2024TRAWL: Tensor Reduced and Approximated Weights for Large Language Modelscited by 5
- 2024Towards LLM-guided Efficient and Interpretable Multi-linear Tensor Network Rank Selectioncited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 11.
12 papers.
- 2026KromHC: Manifold-Constrained Hyper-Connections with Kronecker-Product Residual Matricescited by 11
- 2026Semantic Cache Distillation: Efficient State Transfer via Reuse and Selective Patchingcited by 5
- 2026Rethinking the Role of Tensor Decompositions in Post-Training LLM Compressioncited by 4
- 2026A Practical Tensor-Network Compression Pipeline for Production-Scale Large Language Modelscited by 3
- 2026Tucker Attention: A generalization of approximate attention mechanismscited by 3
- 2026Tensorizing Engram: Sharing Latents Across N-Gram Embeddings is Beneficial in LLMscited by 3
- 2025TeRA: Vector-based Random Tensor Network for High-Rank Adaptation of Large Language Modelscited by 2
- 2026Scalable Knowledge Editing for Mixture-of-Experts LLMs via Tensor-Structured Updatescited by 1
- 2026Tensorion: A Tensor-Aware Generalization of the Muon Optimizercited by 1
- 2026TEMPER: Tensorized Efficient Manifold-constrained Parameterization for Expressive Residual Routingcited by 1
- 2026A Computationally Efficient Multidimensional Vision Transformercited by 0
- 2026Sequential Functional Structured Tucker Compression for Large Language Model Attentionscited by 0
- 2026Sequential Functional Structured Tucker Compression for Large Language Model Attentions30 Sep 2026
- 2026TEMPER: Tensorized Efficient Manifold-constrained Parameterization for Expressive Residual Routing8 Aug 2026
- 2026Tensorion: A Tensor-Aware Generalization of the Muon Optimizer24 Jun 2026
- 2026Tensorizing Engram: Sharing Latents Across N-Gram Embeddings is Beneficial in LLMs6 Jun 2026
- 2026Semantic Cache Distillation: Efficient State Transfer via Reuse and Selective Patching5 Jun 2026
- 2026Rethinking the Role of Tensor Decompositions in Post-Training LLM Compression2 Jun 2026
- 2026Scalable Knowledge Editing for Mixture-of-Experts LLMs via Tensor-Structured Updates15 May 2026
- 2026Tucker Attention: A generalization of approximate attention mechanisms31 Mar 2026
- 2026A Computationally Efficient Multidimensional Vision Transformer23 Feb 2026
- 2026A Practical Tensor-Network Compression Pipeline for Production-Scale Large Language Models2 Feb 2026
- 2026KromHC: Manifold-Constrained Hyper-Connections with Kronecker-Product Residual Matrices29 Jan 2026
- 2025TeRA: Vector-based Random Tensor Network for High-Rank Adaptation of Large Language Models3 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2025LatentLLM: Attention-Aware Joint Tensor Compression
- 2024Compressing Large Language Models with Automated Sub-Network Search
- 2023Just CHOP: Embarrassingly Simple LLM Compression
- 2025TL;DR: Too Long, Do Re-weighting for Efficient LLM Reasoning Compression
- 2025Nemotron Elastic: Towards Efficient Many-in-One Reasoning LLMs
- 2026ChainDoRA: Tensor-Train Factorized Weight-Decomposed Low-Rank Adaptation for Parameter-Efficient LLM Fine-Tuning
- 2024Effectively Compress KV Heads for LLM
- 2026Gradually Compacting Large Language Models for Reasoning Like a Boiling Frog