A Hamiltonian-Inspired Local-Operator Ansatz for Slimming Large Language Models
Not on the map. Why?
Abstract (arXiv)
Dense linear maps carry much of the parameter and computational burden of modern neural networks, yet their dense form leaves the organization of learned couplings implicit. Quantum many-body physics organizes exponentially large operators by writing a global Hamiltonian as a sum of local terms, (hat H=sumkhat hk). Whether the same structural principle can carry learned neural maps is unknown. We introduce Tensor Mixture (MixT), which represents a dense map as a natively executable sum of overlapping local tensor operators without imposing an explicit matrix-rank constraint. The local-term count (NT) sets the effective nonlocality and operator complexity, while the number of replaced Transformer blocks (NB) extends this structural coordinate across network depth. Tests on Qwen3-8B and LLaMA2-7B reveal a broad recoverable regime followed by an abrupt, model-specific boundary that is remarkably stable against changes in (NT). Accuracy and output-distribution statistics reorganize together across the boundary; in LLaMA2-7B, the same depth separates two scaling regimes of inter-layer geometry drift. The directly executed structure also reduces parameters, arithmetic, storage, and memory. These results establish the local-sum structure as a viable organizing principle for learned linear maps at billion-parameter scale and expose a sharp boundary in their tolerance to structural simplification.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 50 references that are in the map. First posted on arXiv 25 May 2026.
Builds on
32 of 50 references.
References · 32
- 2017Attention Is All You Needcited by 59,932
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2022Emergent Abilities of Large Language Modelscited by 2,483
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2023Are Emergent Abilities of Large Language Models a Mirage?cited by 515
20 more
- 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 458
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2015Tensorizing Neural Networkscited by 246
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2024Lessons from the Trenches on Reproducible Evaluation of Language Modelscited by 172
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2019A Tensorized Transformer for Language Modelingcited by 85
- 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 73
- 2024Densing Law of LLMscited by 39
- 2024Investigating Layer Importance in Large Language Modelscited by 35
- 2024Streamlining Redundant Layers to Compress Large Language Modelscited by 32
- 2021Enabling Lightweight Fine-tuning for Pre-trained Language Model Compression based on Matrix Product Operatorscited by 28
- 2019Compressing deep neural networks by matrix product operatorscited by 27
- 2024Compute Better Spent: Replacing Dense Layers with Structured Matricescited by 24
- 2023Tensor networks for interpretable and efficient quantum-inspired machine learningcited by 16
- 2015Compression of Fully-Connected Layer in Neural Network by Kronecker Productcited by 9
- 2023Compressing Neural Networks Using Tensor Networks with Exponentially Fewer Variational Parameterscited by 9
- 2025ProcrustesGPT: Compressing LLMs with Structured Matrices and Orthogonal Transformationscited by 2
- 2026Pruning-induced phases in fully-connected neural networks: the eumentia, the dementia, and the amentiacited by 1
Built on by
Not cited yet.