让轻量模型学会像大模型一样感知输入,提升小模型表现。
Feature Representation Transferring to Lightweight Models via Perception Coherence
- 基于感知一致性设计新损失函数,关注特征空间中样本的排序关系。
- 在多个数据集上超越或媲美强基线,小模型性能显著提升。
- 适合需要高效迁移特征表示的轻量化部署场景。
本文提出一种将大模型特征表示迁移到轻量学生模型的方法。我们数学定义了新的概念——感知一致性,并据此设计了一种损失函数,通过考虑特征空间中数据点间的相对排序差异来实现迁移。该方法的核心思想是:由于学生模型的表征能力弱于教师模型,因此无需完全保留教师模型的绝对几何结构,只需保持全局的相似性排序一致性即可。特别地,尽管排序通常仅针对有限集合定义,我们的感知一致性概念将其扩展为基于输入分布的概率形式,适用于一般距离度量。理论分析提供了特征迁移过程的概率视角。实验结果表明,该方法在多个基准任务上优于或等同于现有强基线方法。
原文摘要 · Abstract (English)
In this paper, we propose a method for transferring feature representation to lightweight student models from larger teacher models. We mathematically define a new notion called \textit{perception coherence}. Based on this notion, we propose a loss function, which takes into account the dissimilarities between data points in feature space through their ranking. At a high level, by minimizing this loss function, the student model learns to mimic how the teacher model \textit{perceives} inputs. More precisely, our method is motivated by the fact that the representational capacity of the student model is weaker than the teacher model. Hence, we aim to develop a new method allowing for a better relaxation. This means that, the student model does not need to preserve the absolute geometry of the teacher one, while preserving global coherence through dissimilarity ranking. Importantly, while rankings are defined only on finite sets, our notion of \textit{perception coherence} extends them into a probabilistic form. This formulation depends on the input distribution and applies to general dissimilarity metrics. Our theoretical insights provide a probabilistic perspective on the process of feature representation transfer. Our experiments results show that our method outperforms or achieves on-par performance compared to strong baseline methods for representation transferring.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。