LRCC: Generalizing Low-Rank Compression with Conditional Computation.

arXiv:2610.08858v1 Announce Type: cross Abstract: Low-rank compression reduces the cost of pretrained language models by replacing linear transformations with low-rank factorizations. However, conventional methods use a fixed rank allocation during inference,