通过随机邻域优化提升长尾视觉分类的泛化能力。
Improving Visual Prompt Tuning by Gaussian Neighborhood Minimization for Long-Tailed Visual Recognition
- 在参数随机邻域内搜索梯度方向,仅需单步计算。
- 在CIFAR100-LT、iNaturalist 2018等数据集上分别达到90.3%、76.5%准确率。
- 适合关注长尾分布下小类性能提升的研究者。
长尾学习近年来受到广泛关注并取得显著进展。然而,即使具备预训练先验知识,模型在尾部类别上的泛化能力仍较弱。虽有尖锐感知最小化(SAM)可通过寻找损失曲面中的平坦极小值有效提升模型泛化能力,但其代价是计算时间翻倍,因每步更新需连续两次不可并行的前向与反向传播。为解决此问题,我们提出一种新方法——随机SAM提示调优(RSAM-PT),在每步更新中仅需单步梯度计算即可提升模型泛化性能。具体而言,我们在每次梯度更新时,在参数的随机邻域内搜索梯度下降方向。为增强尾部样本的影响并避免过拟合,采用延迟重加权策略提升尾部类别的权重。所提方法显著提升了长尾数据的分类准确率,尤其对尾部类别效果明显。在基准数据集CIFAR100-LT(IF 100)、iNaturalist 2018和Places-LT上,分别取得了90.3%、76.5%和50.1%的准确率,达到当前最优水平。源代码暂可在 https://github.com/Keke921/GNM-PT 获取。
原文摘要 · Abstract (English)
Long-tail learning has garnered widespread attention and achieved significant progress in recent times. However, even with pre-trained prior knowledge, models still exhibit weaker generalization performance on tail classes. The promising Sharpness-Aware Minimization (SAM) can effectively improve the generalization capability of models by seeking out flat minima in the loss landscape, which, however, comes at the cost of doubling the computational time. Since the update rule of SAM necessitates two consecutive (non-parallelizable) forward and backpropagation at each step. To address this issue, we propose a novel method called Random SAM prompt tuning (RSAM-PT) to improve the model generalization, requiring only one-step gradient computation at each step. Specifically, we search for the gradient descent direction within a random neighborhood of the parameters during each gradient update. To amplify the impact of tail-class samples and avoid overfitting, we employ the deferred re-weight scheme to increase the significance of tail-class samples. The classification accuracy of long-tailed data can be significantly improved by the proposed RSAM-PT, particularly for tail classes. RSAM-PT achieves the state-of-the-art performance of 90.3\%, 76.5\%, and 50.1\% on benchmark datasets CIFAR100-LT (IF 100), iNaturalist 2018, and Places-LT, respectively. The source code is temporarily available at https://github.com/Keke921/GNM-PT.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。