Paper Overview
Field: Machine Learning Authors: David González-Martínez, Shiwei Liu Published: 2025-07-12 arXiv: 2507.08748
Introduction
Low-rank factorization is widely used to compress neural networks, but modern models are often not naturally amenable to aggressive factorization without significant accuracy loss.
Existing training-time low-rank regularizers can improve compressibility, but they have notable drawbacks:
- Require SVDs of large weight matrices
- Modify the model architecture by introducing additional trainable parameters
- Rely on stateful cached quantities
- SLORR-Hoyer: based on the Hoyer sparsity metric
- SLORR-nuclear: based on the nuclear norm
- ImageNet-1K: Short continued training of ResNet-50, ViT-B/16, and ViT-L/16, plus ResNet-18 pretraining — SLORR improves compressibility with less than 8% training overhead.
- LLM pretraining (135M and 560M scale): SLORR-Hoyer-trained compressed models maintain performance better than unregularized models, with less than 1% average training overhead increase.
SLORR
SLORR addresses these limitations as a simple, stateless, and architecture-preserving framework for in-training low-rank regularization, with two main variants:
SLORR directly regularizes the original weight matrices, using GPU-friendly approximations for the forward and backward passes of the regularizer, and provides approximation guarantees.
Results
Reference
Full paper: https://arxiv.org/abs/2507.08748