Low-Rank Compression
Overview
Low-rank compression represents large matrices and tensors with smaller factors, reducing storage and sometimes the computation needed for training or inference. Common approaches include truncated or randomized SVD, activation- and loss-aware factorization, adaptive rank allocation, and combinations with quantization or sparsity; some methods instead train models or optimizer states directly in low-rank form. Work spans vision and language models, with growing attention to long-context key-value caches, where benchmarks such as LongBench and RULER test whether compressed representations preserve retrieval and reasoning. A central tension is that low reconstruction error does not always preserve task behavior, and fewer parameters do not guarantee faster execution without suitable kernels and workload-aware evaluation.
Latest papers
108 papers22 papers in the last four weeks, up 100% on the four weeks before. 0.1% of all new papers.