SLORR: Simple and Efficient In-Training Low-Rank Regularization
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 often require SVDs of large weight matrices, modify the model architecture (introducing additional trainable parameters), or rely on stateful cached quantities. To address these limitations, we introduce SLORR, a simple, stateless, and architecture-preserving framework for in-training low-rank regularization, instantiated with two mai
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
- Linked via arxiv authorDavid González-Martínez →
SLORR: Simple and Efficient In-Training Low-Rank Regularization
- Linked via arxiv authorShiwei Liu →
SLORR: Simple and Efficient In-Training Low-Rank Regularization
