LRCC: generalizing low-rank compression with conditional computation
Read the original at arxiv.org→arXiv:2610.08858v1 Announce Type: new Abstract: Low-rank compression reduces the cost of pretrained language models by replacing linear transformations with low-rank factorizations. However, conventional methods use...
Original headline: "LRCC: Generalizing Low-Rank Compression with Conditional Computation"
Coverage timeline
- Oct 8, 04:00 UTC arXiv cs.CL lead source LRCC: Generalizing Low-Rank Compression with Conditional Computation