# Preprint proposes matrix compression method that matches or improves standard approximation

_Published Friday, October 9, 2026 at 12:09 AM EDT · AI, Science · Latest · Tier 2 — Notable_

Researchers report a matrix compression method that matches or improves truncated singular value decomposition, which represents data with a smaller low-rank approximation, at equal parameter cost. Their preprint tests the method on synthetic data and real datasets including language-model embedding tables, network traffic and hyperspectral images.

The method, called D-SLR, stores selected rows exactly and approximates the remaining rows. Computing its error-versus-parameter tradeoff and selecting a solution costs three singular value decompositions, without regularization or tuning. It also provides a computable bound on potential improvement from other rank and stored-row choices. The claim that separating exact rows from approximated rows sacrifices no optimum applies under squared error.

## Sources

- [cs.LG updates on arXiv.org](https://arxiv.org/abs/2610.10636)

---
Canonical: https://techandbusiness.org/newswire/McuHLhIzSS7sL660BSdBTh
Published: 2026-10-09T04:09:08.546Z
Story chronology: 2026-10-09T04:00:00.000Z
Retrieved: 2026-10-09T06:34:19.060Z
Publisher: Tech & Business (techandbusiness.org)