在小数据场景下,选对视觉主干网络比用通用模型更关键。
Vision Backbone Efficient Selection for Image Classification in Low-Data Regimes
- 基于数据集特性高效筛选适配的预训练主干网络
- 从1300多个模型中10分钟内找到性能最优者
- 适合资源有限但需快速部署的小样本图像分类任务
迁移学习已成为现代计算机视觉的核心工具,使从业者能利用大规模数据预训练的主干网络,在标注数据有限的情况下训练出高性能模型。选择合适的主干网络至关重要,尤其是在小数据集上,最终性能高度依赖初始特征表示的质量。尽管先前工作已在多个数据集上进行基准测试以识别表现最佳的通用主干,但我们发现,在低数据场景下,主干的有效性高度依赖于具体数据集,不存在始终表现优异的单一主干。为克服这一局限,我们提出将数据集特定的主干选择作为新研究方向,并探索其在低数据条件下的可行性。由于对大型主干池进行全量评估在计算上不可行,我们将视觉主干高效选择(VIBES)形式化为在计算约束下搜索高性能主干的问题。我们定义了解空间,提出了若干启发式方法,并通过在四个多样化数据集上的实验验证了VIBES在低数据图像分类中的可行性。结果表明,即使采用简单的搜索策略,也能在单张NVIDIA RTX A5000 GPU上仅用十分钟,从超过1300个预训练模型中找出性能优异的主干,超越通用基准推荐。
原文摘要 · Abstract (English)
Transfer learning has become an essential tool in modern computer vision, allowing practitioners to leverage backbones, pretrained on large datasets, to train successful models from limited annotated data. Choosing the right backbone is crucial, especially for small datasets, since final performance depends heavily on the quality of the initial feature representations. While prior work has conducted benchmarks across various datasets to identify universal top-performing backbones, we demonstrate that backbone effectiveness is highly dataset-dependent, especially in low-data scenarios where no single backbone consistently excels. To overcome this limitation, we introduce dataset-specific backbone selection as a new research direction and investigate its practical viability in low-data regimes. Since exhaustive evaluation is computationally impractical for large backbone pools, we formalize Vision Backbone Efficient Selection (VIBES) as the problem of searching for high-performing backbones under computational constraints. We define the solution space, propose several heuristics, and demonstrate VIBES feasibility for low-data image classification by performing experiments on four diverse datasets. Our results show that even simple search strategies can find well-suited backbones within a pool of over $1300$ pretrained models, outperforming generic benchmark recommendations within just ten minutes of search time on a single GPU (NVIDIA RTX A5000).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。