English

Compressing Large Language Models with PCA Without Performance Loss

Computational Engineering, Finance, and Science 2025-08-07 v1 Artificial Intelligence

Abstract

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.

Keywords

Cite

@article{arxiv.2508.04307,
  title  = {Compressing Large Language Models with PCA Without Performance Loss},
  author = {Magnus Bengtsson},
  journal= {arXiv preprint arXiv:2508.04307},
  year   = {2025}
}

Comments

23 pages. 4 figures, submitted to journal

R2 v1 2026-07-01T04:37:04.877Z