Compressing Large Language Models with PCA Without Performance Loss
Not on the map. Why?
Abstract (arXiv)
We demonstrate that Principal Component Analysis (PCA), when applied in a structured manner, either to polar-transformed images or segment-wise to token sequences, enables extreme compression of neural models without sacrificing performance. Across three case studies, we show that a one-layer classifier trained on PCA-compressed polar MNIST achieves over 98 percent accuracy using only 840 parameters. A two-layer transformer trained on 70-dimensional PCA-reduced MiniLM embeddings reaches 76.62 percent accuracy on the 20 Newsgroups dataset with just 81000 parameters. A decoder-only transformer generates coherent token sequences from 70-dimensional PCA embeddings while preserving over 97 percent cosine similarity with full MiniLM representations, using less than 17 percent of the parameter count of GPT-2. These results highlight PCA-based input compression as a general and effective strategy for aligning model capacity with information content, enabling lightweight architectures across multiple modalities.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 20 references that are in the map. First posted on arXiv 6 Aug 2025.
Builds on
5 of 20 references.
References · 5
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2018FRAGE: Frequency-Agnostic Word Representationcited by 47
- 2019On the Downstream Performance of Compressed Word Embeddingscited by 13
- 2019Single Training Dimension Selection for Word Embedding with PCAcited by 9
- 2022Knowledge Base Index Compression via Dimensionality and Precision Reductioncited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.