Compressing What Matters: Neuron Importance Meets Data-Aware Low Rank Approximation for Language Model Compression
This paper introduces a novel LLM compression method that combines neuron importance with data-aware low-rank approximation, along with an efficient dynamic compression rate allocation algorithm. The approach outperforms existing methods, especially at high compression ratios.
-->
[Submitted on 30 Jun 2026]
Title:Compressing What Matters: Neuron Importance Meets Data-Aware Low Rank Approximation for Language Model Compression
View a PDF of the paper titled Compressing What Matters: Neuron Importance Meets Data-Aware Low Rank Approximation for Language Model Compression, by Athanasios Ntovas and 2 other authors
View PDF HTML (experimental)
Abstract:To excel at their domain large language models are comprised of billions of parameters. Yet this comes at the cost of huge memory requirements restricting their applicability in resource-constrained environments. To address the problem of neural network (NN) compression Singular Value Decomposition (SVD) has played a key role as a fundamental component for matrix compression through decomposition. To minimize compression error and to maximize the efficacy of the compressed model on the downstream tasks previous works focused on low-rank approximation of the NN's weight matrices either from the perspective of parameter importance or per-layer functional equivalence. While previous works studied the aforementioned perspectives in isolation in this work we are investigating the effectiveness of an approach that combines ideas from these two perspectives in a single objective. In parallel to this an important aspect that affects the compression quality is the distribution of the compression rate across layers and NN parameters. Earlier works mostly considered distributing the compression rate uniformly across layers and network weights or relied on computationally expensive heuristic search. Contrary to them in this work we propose an enhanced and computationally efficient algorithm for dynamic compression rate allocation. Experimental results support the efficacy of the proposed approach which performs on par or substantially better than the previous state-of-the-art especially under high compression ratios.
Subjects:
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as: arXiv:2607.18284 [cs.LG]
(or arXiv:2607.18284v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2607.18284
arXiv-issued DOI via DataCite
Journal reference: EEE Access, vol. 14, pp. 6106-6120, 2026
Related DOI:
https://doi.org/10.1109/ACCESS.2026.3653132
DOI(s) linking to related resources
Submission history
From: Dimitrios Zarpalas [view email] [v1] Tue, 30 Jun 2026 09:16:00 UTC (2,999 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled Compressing What Matters: Neuron Importance Meets Data-Aware Low Rank Approximation for Language Model Compression, by Athanasios Ntovas and 2 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.LG
new | recent | 2026-07
Change to browse by:
cs cs.AI
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Loading...
Data provided by:
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)