自动构建逐层更新的低秩适配框架,参数更少效果更好
AROMA: Autonomous Rank-one Matrix Adaptation
- 通过迭代添加秩一组件实现动态秩增长,无需预设初始秩
- 相比LoRA和AdaLoRA,参数量减少超50%,在常识推理任务上提升2.3个百分点
- 适合资源受限场景下的大模型高效微调,尤其适合追求精度与效率平衡的研究者
随着大语言模型规模持续扩大,参数高效微调(PEFT)变得愈发重要。尽管低秩适配(LoRA)通过低秩更新提供了解决方案,但其静态秩分配可能导致次优结果。自适应低秩适配(AdaLoRA)虽引入动态分配,但仍对初始和目标秩配置敏感。我们提出AROMA,一种通过迭代构建秩一组件并逐步衰减至零的框架,实现层特定更新。不同于现有方法采用秩缩减机制,AROMA采用双循环架构:内循环从每个秩一子空间提取信息,外循环决定秩一子空间数量,即最优秩。通过重置优化器状态保持子空间独立性。AROMA显著减少参数量,相比LoRA和AdaLoRA,在自然语言理解与常识推理任务中均表现更优,为自适应PEFT提供了新思路。代码已开源。
原文摘要 · Abstract (English)
As large language models continue to grow in size, parameter-efficient fine-tuning (PEFT) has become increasingly crucial. While low-rank adaptation (LoRA) offers a solution through low-rank updates, its static rank allocation may yield suboptimal results. Adaptive low-rank adaptation (AdaLoRA) improves this with dynamic allocation but remains sensitive to initial and target rank configurations. We introduce AROMA, a framework that automatically constructs layer-specific updates by iteratively building up rank-one components with very few trainable parameters that gradually diminish to zero. Unlike existing methods that employ rank reduction mechanisms, AROMA introduces a dual-loop architecture for rank growth. The inner loop extracts information from each rank-one subspace, while the outer loop determines the number of rank-one subspaces, i.e., the optimal rank. We reset optimizer states to maintain subspace independence. AROMA significantly reduces parameters compared to LoRA and AdaLoRA while achieving superior performance on natural language understanding and commonsense reasoning tasks, offering new insights into adaptive PEFT. The code is available at \href{https://github.com/ShuDun23/AROMA}{AROMA}.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。