基于距离比的度量学习公式
Distance-Ratio-Based Formulation for Metric Learning
摘要:
在度量学习中,目标是学习一个嵌入,使得具有相同类的数据点彼此接近,而具有不同类的数据点彼此远离。我们提出了一个基于距离比(DR)的度量学习公式。类似于用于度量学习的基于软最大值的公式,它对$p(y=c|x')$建模,$p(y=c|x')$是查询点$x'$属于类$c$的概率。DR制剂具有两个有用的性质。首先,相应的损失不受嵌入的尺度变化的影响。其次,它输出最佳(最大或最小)分类置信度得分代表点的类。为了证明我们的公式的有效性,我们使用基于softmax和DR的公式在CUB和mini-ImageNet数据集上进行了Few-Shot分类实验。结果表明,DR公式通常比基于softmax的公式更快,更稳定的度量学习。因此,使用DR公式实现了改进的或可比较的泛化性能。
英文摘要:
In metric learning, the goal is to learn an embedding so that data points with the same class are close to each other and data points with different classes are far apart. We propose a distance-ratio-based (DR) formulation for metric learning. Like softmax-based formulation for metric learning, it models $p(y=c|x')$, which is a probability that a query point $x'$ belongs to a class $c$. The DR formulation has two useful properties. First, the corresponding loss is not affected by scale changes of an embedding. Second, it outputs the optimal (maximum or minimum) classification confidence scores on representing points for classes. To demonstrate the effectiveness of our formulation, we conduct few-shot classification experiments using softmax-based and DR formulations on CUB and mini-ImageNet datasets. The results show that DR formulation generally enables faster and more stable metric learning than the softmax-based formulation. As a result, using DR formulation achieves improved or comparable generalization performances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。