提出概率化向量随机矩阵适配器,提升小数据下大模型微调性能。
PVeRA: Probabilistic Vector-Based Random Matrix Adaptation
- 用概率化方式随机调整低秩矩阵,增强对输入不确定性的处理能力。
- 在VTAB-1k上优于VeRA及其他适配器,实现更优的参数高效微调效果。
- 适合资源受限场景下的大模型快速迁移,尤其适用于小样本任务。
近年来大规模基础模型在各类任务中不断突破性能极限,但其训练或微调需大量数据与计算资源,常因稀缺而成本高昂。适配方法通过在冻结主干网络上添加少量可训练模块,仅微调这些模块即可实现高效适应,显著降低计算开销。近期的VeRA适配器通过共享跨层的冻结随机低秩矩阵,在参数效率方面表现优异。本文提出PVeRA,为VeRA的低秩矩阵引入概率化修改机制,自然地处理输入中的固有模糊性,并支持训练与测试时的不同采样配置。在VTAB-1k基准与七种适配器的综合评估中,PVeRA超越了VeRA及其他适配器。相关代码已开源:https://github.com/leofillioux/pvera。
原文摘要 · Abstract (English)
Large foundation models have emerged in the last years and are pushing performance boundaries for a variety of tasks. Training or even finetuning such models demands vast datasets and computational resources, which are often scarce and costly. Adaptation methods provide a computationally efficient solution to address these limitations by allowing such models to be finetuned on small amounts of data and computing power. This is achieved by appending new trainable modules to frozen backbones with only a fraction of the trainable parameters and fitting only these modules on novel tasks. Recently, the VeRA adapter was shown to excel in parameter-efficient adaptations by utilizing a pair of frozen random low-rank matrices shared across all layers. In this paper, we propose PVeRA, a probabilistic version of the VeRA adapter, which modifies the low-rank matrices of VeRA in a probabilistic manner. This modification naturally allows handling inherent ambiguities in the input and allows for different sampling configurations during training and testing. A comprehensive evaluation was performed on the VTAB-1k benchmark and seven adapters, with PVeRA outperforming VeRA and other adapters. Our code for training models with PVeRA and benchmarking all adapters is available https://github.com/leofillioux/pvera.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。