arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.04223cs.CV
收藏

用于深度度量学习的多级距离正则化

Multi-level Distance Regularization for Deep Metric Learning

AI Lab, Kakao Enterprise(Kakao Enterprise AI实验室);Kakao Corp.(Kakao公司)

Yonghyun Kim, Wonpyo Park

摘要:

我们提出了一种新的基于距离的正则化方法,用于深度度量学习,称为多级距离正则化(MDR)。MDR通过将嵌入向量之间的成对距离正则化到表示一对之间的相似程度的多个级别中来明确地干扰学习过程。在训练阶段,模型同时使用MDR和深度度量学习的现有损失函数进行训练;这两种损失相互干扰,使学习过程变得困难。此外,MDR防止在学习过程中忽略或过度影响某些示例。这使得嵌入网络的参数能够以更好的泛化能力定在局部最优。在没有花里胡哨的情况下,简单的三重丢失的MDR在各种基准数据集中实现了最先进的性能:CUB-200-2011,Cars-196,Stanford Online Products和In-Shop Clothes Retrieval。我们对其行为进行了广泛的消融研究,以显示MDR的有效性。通过简单地采用我们的MDR,以前的方法可以提高性能和泛化能力。

英文摘要:

We propose a novel distance-based regularization method for deep metric learning called Multi-level Distance Regularization (MDR). MDR explicitly disturbs a learning procedure by regularizing pairwise distances between embedding vectors into multiple levels that represents a degree of similarity between a pair. In the training stage, the model is trained with both MDR and an existing loss function of deep metric learning, simultaneously; the two losses interfere with the objective of each other, and it makes the learning process difficult. Moreover, MDR prevents some examples from being ignored or overly influenced in the learning process. These allow the parameters of the embedding network to be settle on a local optima with better generalization. Without bells and whistles, MDR with simple Triplet loss achieves the-state-of-the-art performance in various benchmark datasets: CUB-200-2011, Cars-196, Stanford Online Products, and In-Shop Clothes Retrieval. We extensively perform ablation studies on its behaviors to show the effectiveness of MDR. By easily adopting our MDR, the previous approaches can be improved in performance and generalization ability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑