用低秩激活压缩大模型,训练更快更省资源。
CoLA: Compute-Efficient Pre-Training of LLMs via Low-Rank Activation
- 用自编码器替代全尺寸层,强制激活保持低秩。
- 训练效率提升1.86倍,计算成本减半,模型缩小2倍。
- 适合资源受限场景的高效大模型预训练。
大语言模型中的全尺寸前馈网络和注意力投影层导致模型体积庞大,预训练时消耗大量计算资源。我们发现预训练大模型的激活具有低秩特性。受此启发,提出CoLA及其内存高效的实现CoLA-M,将这些全尺寸层替换为计算高效的自编码器,自然地在训练中保持低秩激活。这一根本性架构改进消除了激活冗余,显著提升模型容量与训练效率。在参数量为6000万至70亿的LLaMA模型上实验表明,CoLA将计算成本降低2倍,训练吞吐量提升1.86倍,同时保持全秩性能。CoLA-M进一步压缩内存开销而不牺牲吞吐量,提供了参数、计算与内存效率俱佳的预训练方案。生成的模型体积缩小2倍,可在资源受限平台实现更快推理与更低内存占用。
原文摘要 · Abstract (English)
The full-size MLPs and the projection layers in attention introduce tremendous model sizes of large language models (LLMs), consuming extensive computational resources in pre-training. We empirically observe that the activations of pre-trained LLMs exhibit low-rank property. Motivated by such observations, we propose CoLA and its memory-efficient implementation, CoLA-M, to replace these full-size layers with compute-efficient auto-encoders that naturally enforce low-rank activations throughout training. This fundamental architectural change eliminates the activation redundancy and significantly boosts model capacity and training efficiency. Experiments on LLaMA models with 60 million to 7 billion parameters show that CoLA reduces the computing cost by $\bf 2\pmb{\times}$ and improves training throughput by $\bf 1.86\pmb{\times}$ while maintaining full-rank level performance. CoLA-M further squeezes memory cost without sacrificing throughput, offering a pre-training approach with collectively superior parameter, computing, and memory efficiency. The LLMs produced are also $\bf 2\pmb{\times}$ smaller, enabling faster inference with lower memory cost on resource-constrained platforms.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。