arXiv Machine Learning June 15, 2026 By Maksym Shamrai

Concatenated Matrix SVD: Compression Bounds, Incremental Approximation, and Error-Constrained Clustering

Read the original on arXiv Machine Learning →

arXiv:2601. 11626v2 Announce Type: replace-cross Abstract: Large collections of matrices arise throughout modern machine learning, signal processing, and scientific computing, where they are commonly compressed by concatenation followed by truncated singular value decomposition (SVD).

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 21

Preserving Clusters in Error-Bounded Lossy Compression of Scientific Particle Data

arXiv:2604. 18801v2 Announce Type: replace Abstract: Scientific particle simulations in cosmology, molecular dynamics, and fluid dynamics produce large-scale datasets whose storage, movement, and analysis increasingly rely on lossy compression.

By Congrong Ren, Sheng Di, Katrin Heitmann, Franck Cappello, Hanqi Guo

efficiency

arXiv Machine Learning

Aug 11

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

arXiv:2608. 08704v1 Announce Type: cross Abstract: Kernel spectral clustering with a single bandwidth can be inadequate for data exhibiting multiple characteristic pairwise-distance scales, a problem particularly prevalent in the high-dimensional regime.

By Zeqin Lin, Guangming Pan, Zhixiang Zhang, Yinbing Zhou

rag

arXiv Machine Learning

Jun 5

Central Description Length (CDL) Clustering Validation Index

arXiv:2606. 05230v1 Announce Type: cross Abstract: Selecting a clustering algorithm and its hyperparameters without labels is a common difficulty in engineering machine learning pipelines that work with unsupervised analysis of sensor, image, or process data.

By Mahdi Shamsi, Soosan Beheshti

rag benchmarks

arXiv Machine Learning

Jun 2

LASER: Loss-Aware Singular-value Decomposition and Rank Allocation for Efficient Low-Precision Vision-Language Models

arXiv:2606. 00573v1 Announce Type: new Abstract: Vision-language models (VLMs) deliver strong multimodal reasoning capabilities, but their large computational cost and high parameter counts make deployment challenging on resource-constrained devices.

By Haiyu Wang, Yutong Wang, Leshu Li, Yihui Ren, Sai Qian Zhang

llms efficiency multimodal

arXiv Machine Learning

Jun 10

Sample-efficient inductive matrix completion with noise and inexact side-information

arXiv:2605. 17189v2 Announce Type: replace-cross Abstract: Inductive matrix completion (IMC) is a variant of low-rank matrix completion that incorporates row and column side-information.

By Yuepeng Yang, Cong Ma

arXiv AI

Jul 22

Compressing What Matters: Neuron Importance Meets Data-Aware Low Rank Approximation for Language Model Compression

arXiv:2607. 18284v1 Announce Type: cross Abstract: To excel at their domain large language models are comprised of billions of parameters.

By Athanasios Ntovas, Alexandros Doumanoglou, Petros Drakoulis, Dimitris Zarpalas

llms efficiency benchmarks

Related stories

Preserving Clusters in Error-Bounded Lossy Compression of Scientific Particle Data

Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery

Central Description Length (CDL) Clustering Validation Index

LASER: Loss-Aware Singular-value Decomposition and Rank Allocation for Efficient Low-Precision Vision-Language Models

Sample-efficient inductive matrix completion with noise and inexact side-information

Compressing What Matters: Neuron Importance Meets Data-Aware Low Rank Approximation for Language Model Compression